./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 01849734 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-0184973-m [2025-04-24 17:37:54,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-24 17:37:54,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-24 17:37:54,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-24 17:37:54,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-24 17:37:54,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-24 17:37:54,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-24 17:37:54,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-24 17:37:54,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-24 17:37:54,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-24 17:37:54,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-24 17:37:54,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-24 17:37:54,547 INFO L153 SettingsManager]: * Use SBE=true [2025-04-24 17:37:54,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-24 17:37:54,548 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:37:54,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-24 17:37:54,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:37:54,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-24 17:37:54,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2025-04-24 17:37:54,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-24 17:37:54,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-24 17:37:54,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-24 17:37:54,816 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-24 17:37:54,816 INFO L274 PluginConnector]: CDTParser initialized [2025-04-24 17:37:54,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-04-24 17:37:56,174 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f6805ce72/21d361db255b404a9bb7a777b8893094/FLAGb6178447f [2025-04-24 17:37:56,371 INFO L389 CDTParser]: Found 1 translation units. [2025-04-24 17:37:56,371 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-04-24 17:37:56,376 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f6805ce72/21d361db255b404a9bb7a777b8893094/FLAGb6178447f [2025-04-24 17:37:57,225 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f6805ce72/21d361db255b404a9bb7a777b8893094 [2025-04-24 17:37:57,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-24 17:37:57,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-24 17:37:57,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-24 17:37:57,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-24 17:37:57,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-24 17:37:57,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c5ca19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57, skipping insertion in model container [2025-04-24 17:37:57,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-24 17:37:57,390 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2435,2448] [2025-04-24 17:37:57,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 17:37:57,402 INFO L200 MainTranslator]: Completed pre-run [2025-04-24 17:37:57,425 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2435,2448] [2025-04-24 17:37:57,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-24 17:37:57,439 INFO L204 MainTranslator]: Completed translation [2025-04-24 17:37:57,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57 WrapperNode [2025-04-24 17:37:57,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-24 17:37:57,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-24 17:37:57,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-24 17:37:57,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-24 17:37:57,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,464 INFO L138 Inliner]: procedures = 24, calls = 19, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-04-24 17:37:57,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-24 17:37:57,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-24 17:37:57,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-24 17:37:57,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-24 17:37:57,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,481 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-24 17:37:57,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-24 17:37:57,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-24 17:37:57,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-24 17:37:57,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (1/1) ... [2025-04-24 17:37:57,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-24 17:37:57,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:37:57,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-24 17:37:57,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-24 17:37:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-24 17:37:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-24 17:37:57,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-24 17:37:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-24 17:37:57,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-24 17:37:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-24 17:37:57,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-24 17:37:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-24 17:37:57,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-24 17:37:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-24 17:37:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-24 17:37:57,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-24 17:37:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-24 17:37:57,545 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-24 17:37:57,606 INFO L234 CfgBuilder]: Building ICFG [2025-04-24 17:37:57,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-24 17:37:57,820 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-24 17:37:57,820 INFO L283 CfgBuilder]: Performing block encoding [2025-04-24 17:37:57,973 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-24 17:37:57,974 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-24 17:37:57,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 05:37:57 BoogieIcfgContainer [2025-04-24 17:37:57,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-24 17:37:57,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-24 17:37:57,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-24 17:37:57,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-24 17:37:57,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.04 05:37:57" (1/3) ... [2025-04-24 17:37:57,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6c64fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 05:37:57, skipping insertion in model container [2025-04-24 17:37:57,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.04 05:37:57" (2/3) ... [2025-04-24 17:37:57,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6c64fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.04 05:37:57, skipping insertion in model container [2025-04-24 17:37:57,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.04 05:37:57" (3/3) ... [2025-04-24 17:37:57,980 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2025-04-24 17:37:57,990 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-24 17:37:57,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sum-array-hom.wvr.c that has 4 procedures, 24 locations, 24 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-24 17:37:57,992 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-24 17:37:58,041 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-24 17:37:58,067 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 17:37:58,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-24 17:37:58,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:37:58,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-24 17:37:58,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-24 17:37:58,136 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-24 17:37:58,149 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-24 17:37:58,157 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17c1ca3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-24 17:37:58,157 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-24 17:37:58,215 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:37:58,216 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:37:58,217 INFO L139 ounterexampleChecker]: Examining path program with hash -993870185, occurence #1 [2025-04-24 17:37:58,217 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-24 17:37:58,217 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:37:58,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:37:58,221 INFO L85 PathProgramCache]: Analyzing trace with hash -368705343, now seen corresponding path program 1 times [2025-04-24 17:37:58,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:37:58,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870687684] [2025-04-24 17:37:58,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:37:58,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:37:58,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-24 17:37:58,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-24 17:37:58,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:37:58,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:37:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:37:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:37:58,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870687684] [2025-04-24 17:37:58,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870687684] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:37:58,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:37:58,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-24 17:37:58,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924888882] [2025-04-24 17:37:58,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:37:58,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-24 17:37:58,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:37:58,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-24 17:37:58,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-24 17:37:58,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:37:58,645 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:37:58,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 17:37:58,646 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:37:58,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:37:58,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-24 17:37:58,719 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:37:58,719 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:37:58,720 INFO L139 ounterexampleChecker]: Examining path program with hash -993870185, occurence #2 [2025-04-24 17:37:58,720 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:37:58,720 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:37:58,720 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:37:58,720 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-24 17:37:58,723 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:58,723 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-24 17:37:58,723 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:58,723 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-24 17:37:58,723 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:58,723 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-04-24 17:37:58,723 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:58,723 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 21 [2025-04-24 17:37:58,723 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:37:58,723 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:37:58,723 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:37:58,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:37:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1980746140, now seen corresponding path program 1 times [2025-04-24 17:37:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:37:58,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435624236] [2025-04-24 17:37:58,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:37:58,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:37:58,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 17:37:58,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 17:37:58,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:37:58,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:37:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:37:58,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:37:58,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435624236] [2025-04-24 17:37:58,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435624236] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:37:58,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829199315] [2025-04-24 17:37:58,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:37:58,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:37:58,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:37:58,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:37:58,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-24 17:37:58,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-24 17:37:58,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-24 17:37:58,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:37:58,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:37:58,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-24 17:37:58,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:37:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:37:59,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:37:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:37:59,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829199315] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:37:59,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:37:59,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-24 17:37:59,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102572998] [2025-04-24 17:37:59,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:37:59,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-24 17:37:59,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:37:59,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-24 17:37:59,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-24 17:37:59,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:37:59,174 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:37:59,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 17:37:59,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:37:59,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:37:59,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:37:59,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:37:59,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-24 17:37:59,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-24 17:37:59,485 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:37:59,485 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:37:59,485 INFO L139 ounterexampleChecker]: Examining path program with hash -993870185, occurence #3 [2025-04-24 17:37:59,486 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:37:59,486 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:37:59,486 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:37:59,486 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 17:37:59,486 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:59,486 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:37:59,486 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:59,486 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:37:59,486 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:59,486 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-24 17:37:59,486 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:59,486 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-24 17:37:59,486 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:37:59,486 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:37:59,487 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:37:59,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:37:59,487 INFO L85 PathProgramCache]: Analyzing trace with hash -414403295, now seen corresponding path program 2 times [2025-04-24 17:37:59,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:37:59,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556846166] [2025-04-24 17:37:59,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 17:37:59,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:37:59,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-24 17:37:59,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 24 statements. [2025-04-24 17:37:59,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-24 17:37:59,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:37:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-24 17:37:59,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:37:59,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556846166] [2025-04-24 17:37:59,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556846166] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-24 17:37:59,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-24 17:37:59,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-24 17:37:59,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635861050] [2025-04-24 17:37:59,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-24 17:37:59,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-24 17:37:59,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:37:59,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-24 17:37:59,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-24 17:37:59,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:37:59,643 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:37:59,643 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 17:37:59,643 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:37:59,643 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:37:59,643 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:37:59,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:37:59,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:37:59,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 17:37:59,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-24 17:37:59,781 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:37:59,781 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:37:59,781 INFO L139 ounterexampleChecker]: Examining path program with hash -993870185, occurence #4 [2025-04-24 17:37:59,781 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:37:59,781 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:37:59,782 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:37:59,782 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-24 17:37:59,782 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:59,782 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-24 17:37:59,782 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:59,782 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-04-24 17:37:59,782 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:59,782 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2025-04-24 17:37:59,782 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:37:59,782 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-24 17:37:59,782 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:37:59,782 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:37:59,782 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:37:59,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:37:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash 152500462, now seen corresponding path program 1 times [2025-04-24 17:37:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:37:59,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2811920] [2025-04-24 17:37:59,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:37:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:37:59,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 17:37:59,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 17:37:59,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:37:59,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:37:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:37:59,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:37:59,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2811920] [2025-04-24 17:37:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2811920] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:37:59,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685872862] [2025-04-24 17:37:59,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-24 17:37:59,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:37:59,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:37:59,973 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:37:59,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-24 17:38:00,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-24 17:38:00,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-24 17:38:00,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-24 17:38:00,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:38:00,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-24 17:38:00,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:38:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:38:00,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:38:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:38:00,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685872862] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-24 17:38:00,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-24 17:38:00,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-04-24 17:38:00,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158504439] [2025-04-24 17:38:00,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-24 17:38:00,307 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-24 17:38:00,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-24 17:38:00,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-24 17:38:00,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-04-24 17:38:00,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:38:00,309 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-24 17:38:00,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-24 17:38:00,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:38:00,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:38:00,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-24 17:38:00,309 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-24 17:38:00,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-24 17:38:00,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-24 17:38:00,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-24 17:38:00,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-24 17:38:00,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-24 17:38:00,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:38:00,600 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-24 17:38:00,600 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-24 17:38:00,600 INFO L139 ounterexampleChecker]: Examining path program with hash -993870185, occurence #5 [2025-04-24 17:38:00,600 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-24 17:38:00,600 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-24 17:38:00,600 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:38:00,600 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-24 17:38:00,600 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:38:00,600 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-24 17:38:00,600 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:38:00,601 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-24 17:38:00,601 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:38:00,601 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-24 17:38:00,601 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-24 17:38:00,601 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-24 17:38:00,601 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-24 17:38:00,601 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-24 17:38:00,601 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-24 17:38:00,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-24 17:38:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1382797611, now seen corresponding path program 2 times [2025-04-24 17:38:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-24 17:38:00,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658802709] [2025-04-24 17:38:00,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 17:38:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-24 17:38:00,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-24 17:38:00,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:38:00,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:38:00,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:38:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-24 17:38:01,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-24 17:38:01,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658802709] [2025-04-24 17:38:01,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658802709] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-24 17:38:01,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091941161] [2025-04-24 17:38:01,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-24 17:38:01,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-24 17:38:01,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-24 17:38:01,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-24 17:38:01,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-24 17:38:01,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-24 17:38:01,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-24 17:38:01,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-24 17:38:01,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-24 17:38:01,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-24 17:38:01,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-24 17:38:01,787 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-24 17:38:02,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-24 17:38:02,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-24 17:38:02,377 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 17:38:02,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 23 [2025-04-24 17:38:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-24 17:38:02,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-24 17:38:03,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2025-04-24 17:38:03,342 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-24 17:38:03,342 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 594 treesize of output 442 [2025-04-24 17:38:07,214 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:07,649 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:07,758 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:08,089 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:08,307 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:10,715 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:15,063 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:15,374 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:21,956 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:22,116 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:41,375 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:41,552 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:52,864 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:53,417 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:38:53,797 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:54,240 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:57,564 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:58,580 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:38:59,240 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:38:59,915 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:00,448 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:39:00,973 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-24 17:39:01,563 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:39:01,935 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:02,898 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:03,558 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:39:05,134 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:06,450 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:39:07,078 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:07,393 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:08,272 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:13,916 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:14,679 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:39:15,054 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:15,494 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:16,751 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:28,568 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:45,634 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:39:47,936 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:40:15,344 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:40:15,352 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:42:12,671 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:42:14,450 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:42:15,314 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:42:19,187 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:43:16,097 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:43:16,685 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:43:22,477 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:43:26,371 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:43:26,384 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:43:29,273 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:43:32,959 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:25,934 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:26,794 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:27,336 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:28,035 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:28,432 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:48,745 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:48,960 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:50,062 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:50,800 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:51,494 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:52,100 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:52,325 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:54,167 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:54,724 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:44:56,858 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:14,390 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:14,401 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:21,733 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:21,742 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:25,821 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:28,456 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:37,237 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:40,123 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:40,383 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:46,222 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:45:46,509 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:46,800 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:45:47,046 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:47,323 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:47,695 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:45:49,384 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:45:49,695 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:49,952 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:45:50,328 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:45:50,577 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:52,863 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:45:53,143 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:53,637 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:45:53,902 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:54,146 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:45:54,479 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:45:56,411 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:05,771 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:06,625 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:07,130 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:07,435 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:08,868 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:09,155 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:09,383 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:10,652 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:10,965 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:11,219 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:11,532 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:11,733 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-24 17:46:11,958 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:16,077 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:16,297 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:16,504 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:16,789 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:16,993 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:20,355 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:21,433 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:21,682 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:22,968 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:23,249 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:23,657 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:23,984 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:24,298 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:24,623 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:24,910 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:25,290 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:25,638 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:25,981 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-24 17:46:30,443 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:30,857 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:37,108 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:37,708 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:38,191 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:41,611 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:46:41,912 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:42,320 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:45,481 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:51,986 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:51,993 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:46:58,339 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:47:00,021 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:47:01,880 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:47:02,266 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-24 17:47:02,549 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:47:03,965 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:47:25,672 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:47:26,477 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:47:26,722 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:47:27,407 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-24 17:47:27,643 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.