./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6f232940 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 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-19 15:12:33,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-19 15:12:33,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-19 15:12:33,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-19 15:12:33,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-19 15:12:33,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-19 15:12:33,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-19 15:12:33,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-19 15:12:33,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-19 15:12:33,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-19 15:12:33,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-19 15:12:33,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-19 15:12:33,273 INFO L153 SettingsManager]: * Use SBE=true [2025-03-19 15:12:33,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-19 15:12:33,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-19 15:12:33,274 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-19 15:12:33,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-19 15:12:33,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-19 15:12:33,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-19 15:12:33,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-19 15:12:33,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-19 15:12:33,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-19 15:12:33,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-19 15:12:33,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-19 15:12:33,274 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-19 15:12:33,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-19 15:12:33,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-19 15:12:33,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-19 15:12:33,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-19 15:12:33,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-19 15:12:33,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 15:12:33,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-19 15:12:33,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-19 15:12:33,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-19 15:12:33,276 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-19 15:12:33,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-19 15:12:33,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-19 15:12:33,276 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-19 15:12:33,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-19 15:12:33,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-19 15:12:33,276 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-19 15:12:33,276 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-19 15:12:33,277 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE [2025-03-19 15:12:33,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-19 15:12:33,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-19 15:12:33,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-19 15:12:33,512 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-19 15:12:33,512 INFO L274 PluginConnector]: CDTParser initialized [2025-03-19 15:12:33,513 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-03-19 15:12:34,795 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/701fb6087/8c107c5f54bb4147b4fb3dfda932116b/FLAG82c277f32 [2025-03-19 15:12:34,947 INFO L389 CDTParser]: Found 1 translation units. [2025-03-19 15:12:34,950 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-03-19 15:12:34,955 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/701fb6087/8c107c5f54bb4147b4fb3dfda932116b/FLAG82c277f32 [2025-03-19 15:12:35,797 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/701fb6087/8c107c5f54bb4147b4fb3dfda932116b [2025-03-19 15:12:35,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-19 15:12:35,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-19 15:12:35,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-19 15:12:35,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-19 15:12:35,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-19 15:12:35,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:35,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad5d42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35, skipping insertion in model container [2025-03-19 15:12:35,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:35,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-19 15:12:35,938 WARN L250 ndardFunctionHandler]: 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-03-19 15:12:35,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 15:12:35,949 INFO L200 MainTranslator]: Completed pre-run [2025-03-19 15:12:35,972 WARN L250 ndardFunctionHandler]: 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-03-19 15:12:35,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-19 15:12:35,985 INFO L204 MainTranslator]: Completed translation [2025-03-19 15:12:35,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35 WrapperNode [2025-03-19 15:12:35,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-19 15:12:35,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-19 15:12:35,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-19 15:12:35,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-19 15:12:35,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:35,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:36,010 INFO L138 Inliner]: procedures = 24, calls = 19, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-03-19 15:12:36,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-19 15:12:36,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-19 15:12:36,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-19 15:12:36,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-19 15:12:36,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:36,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:36,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:36,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:36,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:36,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:36,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:36,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:36,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:36,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-19 15:12:36,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-19 15:12:36,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-19 15:12:36,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-19 15:12:36,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (1/1) ... [2025-03-19 15:12:36,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-19 15:12:36,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 15:12:36,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-19 15:12:36,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-19 15:12:36,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-19 15:12:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-19 15:12:36,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-19 15:12:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-19 15:12:36,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-19 15:12:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-19 15:12:36,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-19 15:12:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-19 15:12:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-19 15:12:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-19 15:12:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-19 15:12:36,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-19 15:12:36,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-19 15:12:36,087 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-19 15:12:36,154 INFO L234 CfgBuilder]: Building ICFG [2025-03-19 15:12:36,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-19 15:12:36,317 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-19 15:12:36,321 INFO L283 CfgBuilder]: Performing block encoding [2025-03-19 15:12:36,443 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-19 15:12:36,443 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-19 15:12:36,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 03:12:36 BoogieIcfgContainer [2025-03-19 15:12:36,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-19 15:12:36,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-19 15:12:36,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-19 15:12:36,449 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-19 15:12:36,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 03:12:35" (1/3) ... [2025-03-19 15:12:36,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321c3593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 03:12:36, skipping insertion in model container [2025-03-19 15:12:36,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 03:12:35" (2/3) ... [2025-03-19 15:12:36,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321c3593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 03:12:36, skipping insertion in model container [2025-03-19 15:12:36,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 03:12:36" (3/3) ... [2025-03-19 15:12:36,452 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2025-03-19 15:12:36,461 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-19 15:12:36,462 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-03-19 15:12:36,462 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-19 15:12:36,519 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-19 15:12:36,549 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 15:12:36,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-19 15:12:36,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 15:12:36,553 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-03-19 15:12:36,554 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-03-19 15:12:36,605 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-19 15:12:36,612 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-19 15:12:36,617 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;@6c2131c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-19 15:12:36,619 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-19 15:12:36,773 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-03-19 15:12:36,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 15:12:36,776 INFO L85 PathProgramCache]: Analyzing trace with hash -368705343, now seen corresponding path program 1 times [2025-03-19 15:12:36,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 15:12:36,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718542373] [2025-03-19 15:12:36,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 15:12:36,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 15:12:36,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-19 15:12:36,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-19 15:12:36,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 15:12:36,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 15:12:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 15:12:37,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 15:12:37,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718542373] [2025-03-19 15:12:37,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718542373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 15:12:37,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 15:12:37,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-19 15:12:37,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454686548] [2025-03-19 15:12:37,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 15:12:37,108 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-19 15:12:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 15:12:37,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-19 15:12:37,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-19 15:12:37,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 15:12:37,125 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 15:12:37,126 INFO L481 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-03-19 15:12:37,126 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 15:12:37,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 15:12:37,192 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-19 15:12:37,192 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-03-19 15:12:37,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 15:12:37,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1980746140, now seen corresponding path program 1 times [2025-03-19 15:12:37,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 15:12:37,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536075027] [2025-03-19 15:12:37,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 15:12:37,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 15:12:37,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-19 15:12:37,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-19 15:12:37,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 15:12:37,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 15:12:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 15:12:37,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 15:12:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536075027] [2025-03-19 15:12:37,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536075027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 15:12:37,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035848244] [2025-03-19 15:12:37,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 15:12:37,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 15:12:37,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 15:12:37,396 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-03-19 15:12:37,397 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-03-19 15:12:37,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-19 15:12:37,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-19 15:12:37,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 15:12:37,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 15:12:37,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-19 15:12:37,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 15:12:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 15:12:37,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 15:12:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 15:12:37,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035848244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 15:12:37,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 15:12:37,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-19 15:12:37,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135515495] [2025-03-19 15:12:37,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 15:12:37,652 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-19 15:12:37,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 15:12:37,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-19 15:12:37,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-19 15:12:37,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 15:12:37,654 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 15:12:37,654 INFO L481 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-03-19 15:12:37,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 15:12:37,654 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 15:12:37,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 15:12:37,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 15:12:37,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-19 15:12:37,941 WARN L461 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-03-19 15:12:37,941 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-03-19 15:12:37,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 15:12:37,942 INFO L85 PathProgramCache]: Analyzing trace with hash -414403295, now seen corresponding path program 2 times [2025-03-19 15:12:37,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 15:12:37,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771021049] [2025-03-19 15:12:37,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 15:12:37,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 15:12:37,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-19 15:12:37,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 24 statements. [2025-03-19 15:12:37,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-19 15:12:37,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 15:12:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-19 15:12:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 15:12:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771021049] [2025-03-19 15:12:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771021049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-19 15:12:38,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-19 15:12:38,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-19 15:12:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503869281] [2025-03-19 15:12:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-19 15:12:38,067 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-19 15:12:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 15:12:38,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-19 15:12:38,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-19 15:12:38,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 15:12:38,069 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 15:12:38,069 INFO L481 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-03-19 15:12:38,069 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 15:12:38,069 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 15:12:38,069 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 15:12:38,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 15:12:38,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 15:12:38,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-19 15:12:38,203 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-19 15:12:38,203 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-03-19 15:12:38,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 15:12:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash 152500462, now seen corresponding path program 1 times [2025-03-19 15:12:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 15:12:38,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268127159] [2025-03-19 15:12:38,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 15:12:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 15:12:38,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-19 15:12:38,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-19 15:12:38,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 15:12:38,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 15:12:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 15:12:38,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 15:12:38,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268127159] [2025-03-19 15:12:38,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268127159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 15:12:38,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923603803] [2025-03-19 15:12:38,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-19 15:12:38,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 15:12:38,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 15:12:38,360 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-03-19 15:12:38,361 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-03-19 15:12:38,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-19 15:12:38,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-19 15:12:38,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-19 15:12:38,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 15:12:38,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-19 15:12:38,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 15:12:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 15:12:38,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 15:12:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 15:12:38,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923603803] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-19 15:12:38,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-19 15:12:38,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-03-19 15:12:38,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200612887] [2025-03-19 15:12:38,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-19 15:12:38,663 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-19 15:12:38,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-19 15:12:38,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-19 15:12:38,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-03-19 15:12:38,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-19 15:12:38,664 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-19 15:12:38,664 INFO L481 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-03-19 15:12:38,664 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-19 15:12:38,664 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-19 15:12:38,665 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-03-19 15:12:38,665 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-19 15:12:38,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-19 15:12:38,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-19 15:12:38,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-19 15:12:38,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-19 15:12:38,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-19 15:12:38,952 WARN L461 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-03-19 15:12:38,953 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-03-19 15:12:38,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-19 15:12:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1382797611, now seen corresponding path program 2 times [2025-03-19 15:12:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-19 15:12:38,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355903288] [2025-03-19 15:12:38,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 15:12:38,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-19 15:12:38,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-19 15:12:38,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-19 15:12:38,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-19 15:12:38,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 15:12:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-19 15:12:39,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-19 15:12:39,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355903288] [2025-03-19 15:12:39,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355903288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-19 15:12:39,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198058965] [2025-03-19 15:12:39,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-19 15:12:39,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-19 15:12:39,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-19 15:12:39,787 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-03-19 15:12:39,788 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-03-19 15:12:39,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-19 15:12:39,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-19 15:12:39,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-19 15:12:39,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-19 15:12:39,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-19 15:12:39,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-19 15:12:39,982 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-03-19 15:12:40,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-19 15:12:40,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-19 15:12:40,549 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-19 15:12:40,549 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-03-19 15:12:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-19 15:12:40,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-19 15:12:41,481 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-03-19 15:12:41,513 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-19 15:12:41,513 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-03-19 15:12:44,986 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:12:45,393 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:12:45,495 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:12:45,822 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:12:46,028 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:12:48,393 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:12:52,593 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:12:52,853 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:12:59,101 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:12:59,253 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:18,470 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:18,648 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:29,838 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:30,315 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:13:30,667 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:31,102 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:34,505 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:35,562 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:13:36,248 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:36,952 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:37,519 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:13:38,004 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-19 15:13:38,576 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:13:38,950 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:39,879 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:40,534 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:13:42,060 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:43,325 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:13:43,948 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:44,255 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:45,087 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:50,618 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:51,378 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:13:51,753 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:52,193 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:13:53,485 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:14:05,254 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:14:22,353 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:14:24,598 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:14:45,989 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:14:45,998 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:16:37,337 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:16:40,179 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:16:40,975 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:16:42,448 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:17:34,822 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:17:35,450 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:17:41,668 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:17:46,122 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:17:46,135 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:17:50,047 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:17:53,294 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:18:50,239 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:18:51,129 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:18:51,725 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:18:52,539 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:18:52,885 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:12,567 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:12,869 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:13,926 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:14,558 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:15,351 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:15,906 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:16,148 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:17,814 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:18,400 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:20,495 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:37,979 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:37,986 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:45,076 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:45,082 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:49,762 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:52,345 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:19:58,919 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:01,757 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:02,067 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:05,590 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:05,859 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:06,134 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:06,406 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:06,783 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:07,140 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:07,414 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:07,703 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:10,103 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:10,626 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:10,916 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:11,209 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:11,444 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:12,014 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:12,249 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:12,476 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:12,685 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:14,538 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:23,903 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:24,577 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:24,973 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:25,219 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:26,539 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:26,883 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:27,093 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:28,367 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:28,677 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:28,905 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:29,213 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:29,819 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-19 15:20:30,029 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:35,690 WARN L286 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-19 15:20:37,865 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:38,091 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:38,323 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:38,674 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:38,856 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:43,365 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:44,770 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:45,054 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:45,688 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:46,001 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:46,305 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:46,602 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:47,006 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:47,256 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:47,498 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:47,760 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:48,129 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:48,593 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-19 15:20:49,013 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:49,365 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:56,831 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:57,286 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:58,608 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:58,890 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:20:59,181 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:20:59,503 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:01,256 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:07,139 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:07,146 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:14,542 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:15,568 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:21:15,878 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:16,213 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:21:16,574 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:17,946 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:38,434 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:39,314 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:39,556 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:40,282 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:40,493 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:57,310 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:57,400 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:57,495 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:57,604 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:57,692 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:21:57,766 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:22:04,664 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:22:27,965 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:23:57,651 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:00,527 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:22,264 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:23,485 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:24,264 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:26,531 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:26,834 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:27,208 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:29,511 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:31,498 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:31,919 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:32,191 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:24:32,358 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:25:01,749 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:25:01,755 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:25:02,884 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:25:02,896 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:25:14,050 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:25:14,676 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:25:15,027 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:25:48,680 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:25:48,695 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:25:48,701 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:11,809 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:11,823 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:11,836 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:22,405 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:25,726 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:27,670 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:27,940 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:26:29,023 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:26:29,285 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:33,247 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:26:37,479 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-19 15:26:37,808 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-19 15:26:38,192 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:38,983 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:26:40,562 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:46,481 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:46,963 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:47,460 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:49,570 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:50,411 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:50,726 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:51,998 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:52,331 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:52,703 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:26:53,037 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:55,536 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:55,852 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:26:56,203 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:26:56,566 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:57,686 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:26:58,085 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:26:58,335 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:58,855 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-19 15:26:59,172 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:26:59,558 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:26:59,767 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:27:01,594 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:27:01,908 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:27:02,220 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-19 15:27:04,653 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:27:08,395 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-19 15:27:08,794 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-19 15:27:09,456 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. Killed by 15