./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 NONE --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/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 NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 11:35:34,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 11:35:34,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 11:35:34,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 11:35:34,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 11:35:34,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 11:35:34,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 11:35:34,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 11:35:34,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 11:35:34,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 11:35:34,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 11:35:34,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 11:35:34,748 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 11:35:34,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 11:35:34,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 11:35:34,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 11:35:34,749 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 11:35:34,750 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 11:35:34,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 11:35:34,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 11:35:34,750 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 11:35:34,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 11:35:34,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 11:35:34,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 11:35:34,750 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 11:35:34,750 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 11:35:34,750 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 -> NONE [2025-01-23 11:35:34,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 11:35:34,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 11:35:34,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 11:35:34,967 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 11:35:34,967 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 11:35:34,968 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-23 11:35:36,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/f05f8c28e/0f92fb55e3c34814810d42e910348ac2/FLAGda3af3520 [2025-01-23 11:35:36,257 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 11:35:36,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2025-01-23 11:35:36,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/f05f8c28e/0f92fb55e3c34814810d42e910348ac2/FLAGda3af3520 [2025-01-23 11:35:36,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/f05f8c28e/0f92fb55e3c34814810d42e910348ac2 [2025-01-23 11:35:36,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 11:35:36,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 11:35:36,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 11:35:36,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 11:35:36,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 11:35:36,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cea7f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36, skipping insertion in model container [2025-01-23 11:35:36,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 11:35:36,419 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-23 11:35:36,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 11:35:36,431 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 11:35:36,478 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-23 11:35:36,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 11:35:36,495 INFO L204 MainTranslator]: Completed translation [2025-01-23 11:35:36,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36 WrapperNode [2025-01-23 11:35:36,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 11:35:36,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 11:35:36,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 11:35:36,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 11:35:36,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,522 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-01-23 11:35:36,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 11:35:36,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 11:35:36,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 11:35:36,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 11:35:36,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,533 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 11:35:36,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 11:35:36,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 11:35:36,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 11:35:36,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (1/1) ... [2025-01-23 11:35:36,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 11:35:36,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 11:35:36,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-23 11:35:36,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-23 11:35:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 11:35:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-23 11:35:36,601 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-23 11:35:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-23 11:35:36,601 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-23 11:35:36,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 11:35:36,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 11:35:36,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 11:35:36,603 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 11:35:36,657 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 11:35:36,658 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 11:35:36,768 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 11:35:36,768 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 11:35:36,850 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 11:35:36,850 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 11:35:36,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 11:35:36 BoogieIcfgContainer [2025-01-23 11:35:36,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 11:35:36,853 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 11:35:36,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 11:35:36,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 11:35:36,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 11:35:36" (1/3) ... [2025-01-23 11:35:36,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa2d4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 11:35:36, skipping insertion in model container [2025-01-23 11:35:36,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:35:36" (2/3) ... [2025-01-23 11:35:36,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa2d4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 11:35:36, skipping insertion in model container [2025-01-23 11:35:36,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 11:35:36" (3/3) ... [2025-01-23 11:35:36,872 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2025-01-23 11:35:36,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 11:35:36,883 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-23 11:35:36,883 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 11:35:36,919 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-23 11:35:36,949 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 11:35:36,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 11:35:36,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 11:35:36,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-23 11:35:36,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-23 11:35:36,999 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 11:35:37,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 11:35:37,011 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;@13f2f9b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 11:35:37,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-23 11:35:37,191 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-23 11:35:37,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 11:35:37,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1464225346, now seen corresponding path program 1 times [2025-01-23 11:35:37,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 11:35:37,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979226626] [2025-01-23 11:35:37,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 11:35:37,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 11:35:37,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-23 11:35:37,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-23 11:35:37,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 11:35:37,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:35:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 11:35:37,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 11:35:37,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979226626] [2025-01-23 11:35:37,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979226626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 11:35:37,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 11:35:37,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 11:35:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358231265] [2025-01-23 11:35:37,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 11:35:37,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 11:35:37,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 11:35:37,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 11:35:37,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-23 11:35:37,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:35:37,552 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 11:35:37,553 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-23 11:35:37,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:35:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 11:35:37,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 11:35:37,654 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-23 11:35:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 11:35:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash -910422195, now seen corresponding path program 1 times [2025-01-23 11:35:37,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 11:35:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136815511] [2025-01-23 11:35:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 11:35:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 11:35:37,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-23 11:35:37,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-23 11:35:37,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 11:35:37,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:35:37,892 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-23 11:35:37,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 11:35:37,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136815511] [2025-01-23 11:35:37,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136815511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 11:35:37,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 11:35:37,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 11:35:37,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997127937] [2025-01-23 11:35:37,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 11:35:37,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 11:35:37,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 11:35:37,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 11:35:37,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-23 11:35:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:35:37,894 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 11:35:37,894 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-23 11:35:37,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 11:35:37,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:35:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 11:35:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:35:37,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 11:35:37,967 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-23 11:35:37,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 11:35:37,967 INFO L85 PathProgramCache]: Analyzing trace with hash 817022079, now seen corresponding path program 1 times [2025-01-23 11:35:37,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 11:35:37,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16394287] [2025-01-23 11:35:37,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 11:35:37,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 11:35:37,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-23 11:35:38,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-23 11:35:38,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 11:35:38,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:35:38,456 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-23 11:35:38,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 11:35:38,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16394287] [2025-01-23 11:35:38,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16394287] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 11:35:38,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138062234] [2025-01-23 11:35:38,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 11:35:38,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 11:35:38,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 11:35:38,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 11:35:38,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-23 11:35:38,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-23 11:35:38,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-23 11:35:38,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 11:35:38,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:35:38,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-23 11:35:38,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 11:35:38,614 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-23 11:35:38,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 11:35:38,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138062234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 11:35:38,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-23 11:35:38,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-01-23 11:35:38,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110727364] [2025-01-23 11:35:38,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 11:35:38,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 11:35:38,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 11:35:38,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 11:35:38,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-23 11:35:38,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:35:38,619 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 11:35:38,619 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-23 11:35:38,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 11:35:38,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:35:38,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:35:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 11:35:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:35:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:35:38,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-23 11:35:38,902 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-23 11:35:38,902 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-23 11:35:38,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 11:35:38,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1024522145, now seen corresponding path program 1 times [2025-01-23 11:35:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 11:35:38,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277107374] [2025-01-23 11:35:38,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 11:35:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 11:35:38,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-23 11:35:38,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-23 11:35:38,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 11:35:38,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:35:39,255 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-23 11:35:39,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 11:35:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277107374] [2025-01-23 11:35:39,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277107374] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 11:35:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454996689] [2025-01-23 11:35:39,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 11:35:39,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 11:35:39,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 11:35:39,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-23 11:35:39,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-23 11:35:39,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-23 11:35:39,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-23 11:35:39,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 11:35:39,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:35:39,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-23 11:35:39,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 11:35:39,455 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-23 11:35:39,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 11:35:39,534 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-23 11:35:39,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454996689] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 11:35:39,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 11:35:39,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2025-01-23 11:35:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066632137] [2025-01-23 11:35:39,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 11:35:39,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-23 11:35:39,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 11:35:39,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-23 11:35:39,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-23 11:35:39,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:35:39,536 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 11:35:39,536 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-23 11:35:39,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 11:35:39,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:35:39,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:35:39,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:35:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 11:35:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:35:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:35:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-23 11:35:40,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-23 11:35:40,589 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-23 11:35:40,589 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-23 11:35:40,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 11:35:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2126736295, now seen corresponding path program 2 times [2025-01-23 11:35:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 11:35:40,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666543183] [2025-01-23 11:35:40,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 11:35:40,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 11:35:40,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-01-23 11:35:40,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-01-23 11:35:40,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 11:35:40,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:35:41,116 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-23 11:35:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 11:35:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666543183] [2025-01-23 11:35:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666543183] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 11:35:41,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11065183] [2025-01-23 11:35:41,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 11:35:41,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 11:35:41,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 11:35:41,122 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-23 11:35:41,125 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-23 11:35:41,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-01-23 11:35:41,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 91 of 91 statements. [2025-01-23 11:35:41,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 11:35:41,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:35:41,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-23 11:35:41,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 11:35:41,893 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-23 11:35:41,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 11:35:42,649 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-23 11:35:42,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11065183] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 11:35:42,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 11:35:42,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 13] total 29 [2025-01-23 11:35:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763858275] [2025-01-23 11:35:42,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 11:35:42,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-23 11:35:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 11:35:42,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-23 11:35:42,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-01-23 11:35:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:35:42,652 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 11:35:42,652 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-23 11:35:42,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 11:35:42,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:35:42,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:35:42,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-01-23 11:35:42,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:35:51,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:36:01,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:36:23,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:36:29,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:36:33,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:36:44,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:37:00,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:37:02,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:37:15,095 WARN L286 SmtUtils]: Spent 5.54s 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-23 11:37:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 11:37:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:37:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:37:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-23 11:37:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-23 11:37:15,103 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-23 11:37:15,297 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-23 11:37:15,297 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-23 11:37:15,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 11:37:15,297 INFO L85 PathProgramCache]: Analyzing trace with hash 270988792, now seen corresponding path program 3 times [2025-01-23 11:37:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 11:37:15,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816840793] [2025-01-23 11:37:15,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 11:37:15,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 11:37:15,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-01-23 11:37:15,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-01-23 11:37:15,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-01-23 11:37:15,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:37:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 27 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 11:37:36,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 11:37:36,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816840793] [2025-01-23 11:37:36,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816840793] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 11:37:36,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89591319] [2025-01-23 11:37:36,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 11:37:36,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 11:37:36,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 11:37:36,511 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-23 11:37:36,512 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-23 11:37:36,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 216 statements into 15 equivalence classes. [2025-01-23 11:37:38,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 216 of 216 statements. [2025-01-23 11:37:38,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-01-23 11:37:38,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 11:37:38,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-01-23 11:37:38,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 11:37:53,013 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-23 11:37:53,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 11:38:21,875 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-23 11:38:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89591319] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 11:38:21,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 11:38:21,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 49, 48] total 143 [2025-01-23 11:38:21,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908099298] [2025-01-23 11:38:21,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 11:38:21,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2025-01-23 11:38:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 11:38:21,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2025-01-23 11:38:21,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2392, Invalid=17911, Unknown=3, NotChecked=0, Total=20306 [2025-01-23 11:38:21,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:38:21,886 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 11:38:21,887 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-23 11:38:21,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 11:38:21,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:38:21,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 11:38:21,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-01-23 11:38:21,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2025-01-23 11:38:21,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 11:38:30,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:38:34,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:38:40,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:38:50,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:38:51,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:02,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:04,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:05,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:16,067 WARN L286 SmtUtils]: Spent 7.35s 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-23 11:39:29,591 WARN L286 SmtUtils]: Spent 5.22s 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-23 11:39:36,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:45,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:47,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:51,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:53,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:39:55,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:40:12,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:40:27,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:40:46,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:40:48,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:40:56,099 WARN L286 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 62 DAG size of output: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:41:12,371 WARN L286 SmtUtils]: Spent 11.60s 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-23 11:41:23,716 WARN L286 SmtUtils]: Spent 6.97s 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-23 11:41:26,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:41:30,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:41:39,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:41:41,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:41:43,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:41:54,890 WARN L286 SmtUtils]: Spent 5.03s 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-23 11:42:09,522 WARN L286 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 96 DAG size of output: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:42:18,814 WARN L286 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 59 DAG size of output: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:42:38,880 WARN L286 SmtUtils]: Spent 16.74s on a formula simplification. DAG size of input: 72 DAG size of output: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:42:47,998 WARN L286 SmtUtils]: Spent 7.61s on a formula simplification. DAG size of input: 69 DAG size of output: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:42:51,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:42:53,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:42:57,007 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse51 (+ c_~i1~0 1))) (let ((.cse4 (mod .cse51 2)) (.cse47 (mod (+ c_~i2~0 12) 4294967296)) (.cse48 (mod (+ 5 c_~i2~0) 4294967296)) (.cse2 (mod c_~i1~0 2)) (.cse6 (* c_~N~0 2)) (.cse7 (* 4294967295 c_~i2~0))) (let ((.cse13 (mod (+ c_~i1~0 20) 4294967296)) (.cse19 (mod (+ 23 c_~i2~0) 4294967296)) (.cse29 (mod (+ c_~i2~0 17) 4294967296)) (.cse12 (mod (+ c_~i2~0 11) 4294967296)) (.cse36 (mod (+ .cse6 3 .cse7) 4294967296)) (.cse21 (+ .cse6 .cse2)) (.cse22 (mod (+ c_~i1~0 18) 4294967296)) (.cse5 (mod (+ c_~i2~0 20) 4294967296)) (.cse17 (mod c_~i1~0 4294967296)) (.cse23 (mod (+ 21 c_~i2~0) 4294967296)) (.cse34 (mod (+ c_~i1~0 14) 4294967296)) (.cse32 (mod (+ c_~i1~0 4) 4294967296)) (.cse16 (+ .cse48 .cse2 1)) (.cse28 (mod (+ c_~i1~0 15) 4294967296)) (.cse39 (mod (+ 7 c_~i2~0) 4294967296)) (.cse35 (mod (+ c_~i1~0 4294967288) 4294967296)) (.cse30 (mod (+ c_~i1~0 12) 4294967296)) (.cse25 (mod (+ 14 c_~i2~0) 4294967296)) (.cse42 (mod (+ c_~i2~0 18) 4294967296)) (.cse43 (mod (+ c_~i1~0 16) 4294967296)) (.cse15 (mod (+ c_~i1~0 2) 4294967296)) (.cse11 (mod (+ c_~i1~0 7) 4294967296)) (.cse1 (mod (+ c_~i2~0 10) 4294967296)) (.cse26 (mod (+ c_~i1~0 10) 4294967296)) (.cse24 (mod (+ c_~i1~0 11) 4294967296)) (.cse46 (mod (+ c_~i2~0 13) 4294967296)) (.cse3 (mod (+ c_~i1~0 17) 4294967296)) (.cse44 (mod (+ 19 c_~i2~0) 4294967296)) (.cse40 (mod (+ c_~i1~0 19) 4294967296)) (.cse14 (mod (+ 22 c_~i2~0) 4294967296)) (.cse18 (mod (+ 3 c_~i2~0) 4294967296)) (.cse37 (mod (+ c_~i1~0 8) 4294967296)) (.cse27 (+ .cse47 .cse2 1)) (.cse8 (* (div c_~N~0 2147483648) 4294967296)) (.cse20 (mod (+ .cse6 5 .cse7) 4294967296)) (.cse9 (mod (+ c_~i1~0 4294967286) 4294967296)) (.cse10 (+ .cse4 .cse6)) (.cse38 (mod (+ c_~i1~0 5) 4294967296)) (.cse33 (mod (+ 6 c_~i2~0) 4294967296)) (.cse49 (mod .cse51 4294967296)) (.cse45 (mod (+ c_~i2~0 4) 4294967296)) (.cse0 (mod (+ c_~i1~0 6) 4294967296)) (.cse31 (mod (+ 15 c_~i2~0) 4294967296)) (.cse50 (mod (+ c_~i1~0 13) 4294967296)) (.cse41 (mod (+ 16 c_~i2~0) 4294967296))) (and (< .cse0 (+ .cse1 .cse2 1)) (< .cse3 (+ .cse4 .cse5 1)) (<= (+ (mod (+ .cse6 4 .cse7) 4294967296) .cse8 6 .cse9) .cse10) (< .cse11 (+ .cse4 .cse12 1)) (< .cse13 (+ .cse14 .cse2 1)) (< .cse15 .cse16) (< .cse17 (+ .cse18 .cse2 1)) (< (mod (+ c_~i1~0 21) 4294967296) (+ .cse4 .cse19 1)) (<= (+ .cse8 .cse20 (mod (+ c_~i1~0 4294967285) 4294967296) 6) .cse21) (< .cse22 (+ .cse23 .cse2 1)) (< .cse24 (+ .cse4 .cse25 1)) (< .cse13 (+ .cse2 .cse19 1)) (< .cse26 .cse27) (< .cse28 (+ .cse4 .cse29 1)) (< .cse0 (+ (mod (+ 8 c_~i2~0) 4294967296) .cse2 1)) (< .cse30 (+ .cse31 .cse2 1)) (< .cse32 (+ .cse33 .cse2 1)) (< .cse34 (+ .cse29 .cse2 1)) (<= (+ .cse8 .cse35 6 .cse36) .cse10) (< .cse37 (+ .cse12 .cse2 1)) (< .cse38 (+ .cse4 .cse39 1)) (<= (+ .cse8 (mod (+ c_~i1~0 4294967287) 4294967296) 6 .cse36) .cse21) (< .cse22 (+ .cse5 .cse2 1)) (< .cse17 (+ .cse2 (mod (+ 2 c_~i2~0) 4294967296) 1)) (< .cse40 (+ .cse4 .cse23 1)) (< .cse34 (+ .cse41 .cse2 1)) (< .cse32 .cse16) (< .cse28 (+ .cse42 .cse4 1)) (< .cse0 (+ .cse2 .cse39 1)) (<= (+ (mod (+ .cse6 2 .cse7) 4294967296) .cse8 .cse35 6) .cse10) (< .cse30 (+ .cse25 .cse2 1)) (<= (+ .cse8 (mod (+ .cse6 6 .cse7) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse10) (< .cse43 (+ .cse42 .cse2 1)) (< .cse43 (+ .cse44 .cse2 1)) (< .cse15 (+ .cse2 .cse45 1)) (< .cse11 (+ .cse4 .cse1 1)) (< .cse26 (+ .cse46 .cse2 1)) (<= (+ (mod (+ .cse6 .cse7 1) 4294967296) .cse8 6 (mod (+ c_~i1~0 4294967290) 4294967296)) .cse10) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse4 .cse47 1)) (< .cse24 (+ .cse4 .cse46 1)) (< .cse3 (+ .cse4 .cse44 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse4 .cse48 1)) (< .cse40 (+ .cse4 .cse14 1)) (< .cse49 (+ .cse4 .cse18 1)) (< .cse37 .cse27) (<= (+ .cse8 .cse20 6 .cse9) .cse10) (< .cse38 (+ .cse4 .cse33 1)) (< .cse49 (+ .cse4 .cse45 1)) (< .cse0 (+ (mod (+ 9 c_~i2~0) 4294967296) .cse2 1)) (< .cse50 (+ .cse4 .cse31 1)) (< .cse50 (+ .cse4 .cse41 1)))))) is different from false [2025-01-23 11:42:59,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~i1~0 1))) (let ((.cse5 (mod .cse9 2)) (.cse2 (* c_~N~0 2)) (.cse4 (mod c_~i1~0 2))) (let ((.cse1 (mod c_~i2~0 4294967296)) (.cse8 (+ .cse2 .cse4)) (.cse6 (* 4294967295 c_~i2~0)) (.cse0 (* (div c_~N~0 2147483648) 4294967296)) (.cse7 (+ .cse5 .cse2)) (.cse3 (mod (+ c_~i1~0 6) 4294967296))) (and (<= (+ .cse0 .cse1 1) .cse2) (< .cse3 (+ (mod (+ c_~i2~0 10) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 17) 4294967296) (+ .cse5 (mod (+ c_~i2~0 20) 4294967296) 1)) (<= (+ (mod (+ .cse2 4 .cse6) 4294967296) .cse0 6 (mod (+ c_~i1~0 4294967286) 4294967296)) .cse7) (< (mod (+ c_~i1~0 7) 4294967296) (+ .cse5 (mod (+ c_~i2~0 11) 4294967296) 1)) (< (mod c_~i1~0 4294967296) (+ (mod (+ 3 c_~i2~0) 4294967296) .cse4 1)) (<= (+ .cse0 (mod (+ .cse2 5 .cse6) 4294967296) (mod (+ c_~i1~0 4294967285) 4294967296) 6) .cse8) (< (mod (+ c_~i1~0 18) 4294967296) (+ (mod (+ 21 c_~i2~0) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 11) 4294967296) (+ .cse5 (mod (+ 14 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 20) 4294967296) (+ .cse4 (mod (+ 23 c_~i2~0) 4294967296) 1)) (<= (+ 5 (mod (+ c_~i1~0 4294967291) 4294967296)) (+ .cse1 .cse4)) (< .cse3 (+ (mod (+ 8 c_~i2~0) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 12) 4294967296) (+ (mod (+ 15 c_~i2~0) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 4) 4294967296) (+ (mod (+ 6 c_~i2~0) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 14) 4294967296) (+ (mod (+ c_~i2~0 17) 4294967296) .cse4 1)) (<= (+ .cse0 (mod (+ c_~i1~0 4294967287) 4294967296) 6 (mod (+ .cse2 3 .cse6) 4294967296)) .cse8) (< (mod (+ c_~i1~0 15) 4294967296) (+ (mod (+ c_~i2~0 18) 4294967296) .cse5 1)) (< .cse3 (+ .cse4 (mod (+ 7 c_~i2~0) 4294967296) 1)) (<= (+ (mod (+ .cse2 2 .cse6) 4294967296) .cse0 (mod (+ c_~i1~0 4294967288) 4294967296) 6) .cse7) (<= (+ .cse0 (mod (+ .cse2 6 .cse6) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse7) (< (mod (+ c_~i1~0 16) 4294967296) (+ (mod (+ 19 c_~i2~0) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 10) 4294967296) (+ (mod (+ c_~i2~0 13) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse5 (mod (+ c_~i2~0 12) 4294967296) 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse5 (mod (+ 5 c_~i2~0) 4294967296) 1)) (<= (+ (mod (+ .cse2 4294967295 .cse6) 4294967296) .cse0 5 (mod (+ c_~i1~0 4294967292) 4294967296)) .cse7) (< (mod (+ c_~i1~0 19) 4294967296) (+ .cse5 (mod (+ 22 c_~i2~0) 4294967296) 1)) (< (mod .cse9 4294967296) (+ .cse5 (mod (+ c_~i2~0 4) 4294967296) 1)) (< .cse3 (+ (mod (+ 9 c_~i2~0) 4294967296) .cse4 1)) (< (mod (+ c_~i1~0 13) 4294967296) (+ .cse5 (mod (+ 16 c_~i2~0) 4294967296) 1)))))) is different from false [2025-01-23 11:43:01,029 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-23 11:43:26,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~i1~0 1))) (let ((.cse0 (mod .cse5 2)) (.cse2 (* c_~N~0 2))) (let ((.cse1 (* (div c_~N~0 2147483648) 4294967296)) (.cse3 (* 4294967295 c_~i2~0)) (.cse4 (+ .cse0 .cse2))) (and (< (mod (+ c_~i1~0 21) 4294967296) (+ .cse0 (mod (+ 23 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 15) 4294967296) (+ .cse0 (mod (+ c_~i2~0 17) 4294967296) 1)) (<= (+ .cse1 (mod (+ c_~i1~0 4294967288) 4294967296) 6 (mod (+ .cse2 3 .cse3) 4294967296)) .cse4) (< (mod (+ c_~i1~0 19) 4294967296) (+ .cse0 (mod (+ 21 c_~i2~0) 4294967296) 1)) (<= (+ .cse1 (mod (+ .cse2 6 .cse3) 4294967296) 6 (mod (+ c_~i1~0 4294967284) 4294967296)) .cse4) (< (mod (+ c_~i1~0 7) 4294967296) (+ .cse0 (mod (+ c_~i2~0 10) 4294967296) 1)) (<= (+ (mod (+ .cse2 .cse3 1) 4294967296) .cse1 6 (mod (+ c_~i1~0 4294967290) 4294967296)) .cse4) (< (mod (+ c_~i1~0 9) 4294967296) (+ .cse0 (mod (+ c_~i2~0 12) 4294967296) 1)) (< (mod (+ c_~i1~0 11) 4294967296) (+ .cse0 (mod (+ c_~i2~0 13) 4294967296) 1)) (< (mod (+ c_~i1~0 17) 4294967296) (+ .cse0 (mod (+ 19 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 3) 4294967296) (+ .cse0 (mod (+ 5 c_~i2~0) 4294967296) 1)) (< (mod .cse5 4294967296) (+ .cse0 (mod (+ 3 c_~i2~0) 4294967296) 1)) (<= (+ .cse1 (mod (+ .cse2 5 .cse3) 4294967296) 6 (mod (+ c_~i1~0 4294967286) 4294967296)) .cse4) (< (mod (+ c_~i1~0 5) 4294967296) (+ .cse0 (mod (+ 6 c_~i2~0) 4294967296) 1)) (< (mod (+ c_~i1~0 13) 4294967296) (+ .cse0 (mod (+ 15 c_~i2~0) 4294967296) 1)))))) is different from false [2025-01-23 11:49:03,589 WARN L286 SmtUtils]: Spent 55.35s on a formula simplification. DAG size of input: 125 DAG size of output: 125 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-23 11:49:05,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:07,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:09,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:10,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:12,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:14,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:16,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:18,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-23 11:49:20,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:22,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:24,887 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 [0] [2025-01-23 11:49:26,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:28,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:30,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:33,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:35,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:37,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:39,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:41,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:42,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:44,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:46,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:48,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:50,883 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 [] [2025-01-23 11:49:52,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:54,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:49:56,079 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 [] [2025-01-23 11:49:58,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:50:00,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:50:02,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:50:04,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:50:05,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:50:07,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:50:10,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:50:12,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:50:14,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-23 11:50:16,142 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