./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 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-array-sum.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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 03:35:11,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 03:35:11,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 03:35:11,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 03:35:11,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 03:35:11,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 03:35:11,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 03:35:11,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 03:35:11,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 03:35:11,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 03:35:11,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 03:35:11,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 03:35:11,343 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 03:35:11,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 03:35:11,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 03:35:11,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 03:35:11,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 03:35:11,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 03:35:11,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 03:35:11,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:35:11,345 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 03:35:11,345 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 03:35:11,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 03:35:11,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 03:35:11,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:35:11,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 03:35:11,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 03:35:11,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 03:35:11,346 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 03:35:11,346 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 03:35:11,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 03:35:11,346 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 03:35:11,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 03:35:11,346 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 03:35:11,346 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 03:35:11,346 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 03:35:11,347 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-04-25 03:35:11,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 03:35:11,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 03:35:11,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 03:35:11,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 03:35:11,594 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 03:35:11,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-04-25 03:35:12,960 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a861b88f5/92749388b9fa4d92a390f967fd8210d7/FLAG37573d987 [2025-04-25 03:35:13,168 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 03:35:13,168 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-04-25 03:35:13,174 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a861b88f5/92749388b9fa4d92a390f967fd8210d7/FLAG37573d987 [2025-04-25 03:35:13,962 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a861b88f5/92749388b9fa4d92a390f967fd8210d7 [2025-04-25 03:35:13,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 03:35:13,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 03:35:13,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 03:35:13,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 03:35:13,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 03:35:13,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 03:35:13" (1/1) ... [2025-04-25 03:35:13,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa9016a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:13, skipping insertion in model container [2025-04-25 03:35:13,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 03:35:13" (1/1) ... [2025-04-25 03:35:13,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 03:35:14,126 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-array-sum.wvr.c[2423,2436] [2025-04-25 03:35:14,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 03:35:14,148 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 03:35:14,170 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-array-sum.wvr.c[2423,2436] [2025-04-25 03:35:14,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 03:35:14,194 INFO L204 MainTranslator]: Completed translation [2025-04-25 03:35:14,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14 WrapperNode [2025-04-25 03:35:14,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 03:35:14,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 03:35:14,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 03:35:14,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 03:35:14,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,236 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-04-25 03:35:14,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 03:35:14,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 03:35:14,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 03:35:14,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 03:35:14,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 03:35:14,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 03:35:14,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 03:35:14,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 03:35:14,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (1/1) ... [2025-04-25 03:35:14,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:35:14,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:35:14,293 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-25 03:35:14,296 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-25 03:35:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 03:35:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 03:35:14,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 03:35:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 03:35:14,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 03:35:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-25 03:35:14,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-25 03:35:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 03:35:14,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-25 03:35:14,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-25 03:35:14,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 03:35:14,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 03:35:14,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-25 03:35:14,319 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 03:35:14,401 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 03:35:14,402 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 03:35:14,744 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 03:35:14,744 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 03:35:15,011 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 03:35:15,012 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 03:35:15,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 03:35:15 BoogieIcfgContainer [2025-04-25 03:35:15,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 03:35:15,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 03:35:15,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 03:35:15,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 03:35:15,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 03:35:13" (1/3) ... [2025-04-25 03:35:15,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248fb003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 03:35:15, skipping insertion in model container [2025-04-25 03:35:15,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:35:14" (2/3) ... [2025-04-25 03:35:15,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248fb003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 03:35:15, skipping insertion in model container [2025-04-25 03:35:15,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 03:35:15" (3/3) ... [2025-04-25 03:35:15,020 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-04-25 03:35:15,031 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 03:35:15,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 29 locations, 30 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-25 03:35:15,033 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 03:35:15,087 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-25 03:35:15,116 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 03:35:15,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 03:35:15,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:35:15,119 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-25 03:35:15,120 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-25 03:35:15,184 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 03:35:15,191 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 03:35:15,196 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;@77a708e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 03:35:15,197 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-25 03:35:15,255 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-25 03:35:15,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:35:15,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1978746636, now seen corresponding path program 1 times [2025-04-25 03:35:15,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:35:15,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880434934] [2025-04-25 03:35:15,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:35:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:35:15,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-25 03:35:15,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-25 03:35:15,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:35:15,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:15,540 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-25 03:35:15,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:35:15,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880434934] [2025-04-25 03:35:15,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880434934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:35:15,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:35:15,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 03:35:15,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801297069] [2025-04-25 03:35:15,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:35:15,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 03:35:15,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:35:15,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 03:35:15,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 03:35:15,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:15,580 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:35:15,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 03:35:15,581 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:15,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:15,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 03:35:15,662 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-25 03:35:15,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:35:15,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1659369491, now seen corresponding path program 1 times [2025-04-25 03:35:15,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:35:15,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213976830] [2025-04-25 03:35:15,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:35:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:35:15,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 03:35:15,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 03:35:15,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:35:15,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 03:35:15,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:35:15,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213976830] [2025-04-25 03:35:15,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213976830] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:35:15,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:35:15,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 03:35:15,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455186165] [2025-04-25 03:35:15,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:35:15,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 03:35:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:35:15,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 03:35:15,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 03:35:15,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:15,875 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:35:15,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-25 03:35:15,875 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:15,875 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:15,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:15,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:15,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 03:35:15,958 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-25 03:35:15,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:35:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash 422313311, now seen corresponding path program 1 times [2025-04-25 03:35:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:35:15,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380485412] [2025-04-25 03:35:15,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:35:15,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:35:15,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 03:35:15,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 03:35:15,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:35:15,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:35:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:35:16,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380485412] [2025-04-25 03:35:16,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380485412] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:35:16,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287901605] [2025-04-25 03:35:16,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:35:16,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:35:16,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:35:16,202 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-25 03:35:16,204 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-25 03:35:16,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 03:35:16,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 03:35:16,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:35:16,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:16,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-25 03:35:16,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:35:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:35:16,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:35:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:35:16,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287901605] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-25 03:35:16,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:35:16,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-25 03:35:16,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725830636] [2025-04-25 03:35:16,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:35:16,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 03:35:16,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:35:16,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 03:35:16,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-25 03:35:16,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:16,448 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:35:16,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-25 03:35:16,449 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:16,449 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:16,449 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:16,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:16,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:16,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:16,514 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-25 03:35:16,708 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,SelfDestructingSolverStorable2 [2025-04-25 03:35:16,708 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-25 03:35:16,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:35:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1311441986, now seen corresponding path program 1 times [2025-04-25 03:35:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:35:16,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375430167] [2025-04-25 03:35:16,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:35:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:35:16,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 03:35:16,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 03:35:16,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:35:16,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-25 03:35:16,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:35:16,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375430167] [2025-04-25 03:35:16,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375430167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:35:16,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:35:16,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 03:35:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296002180] [2025-04-25 03:35:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:35:16,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 03:35:16,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:35:16,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 03:35:16,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 03:35:16,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:16,797 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:35:16,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-25 03:35:16,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:16,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:16,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:16,797 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:16,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:16,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:16,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:16,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:16,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 03:35:16,863 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-25 03:35:16,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:35:16,863 INFO L85 PathProgramCache]: Analyzing trace with hash 71415543, now seen corresponding path program 1 times [2025-04-25 03:35:16,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:35:16,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462298268] [2025-04-25 03:35:16,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:35:16,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:35:16,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-25 03:35:16,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 03:35:16,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:35:16,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:35:17,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:35:17,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462298268] [2025-04-25 03:35:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462298268] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:35:17,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307220183] [2025-04-25 03:35:17,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:35:17,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:35:17,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:35:17,784 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-25 03:35:17,787 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-25 03:35:17,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-25 03:35:17,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 03:35:17,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:35:17,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:17,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-25 03:35:17,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:35:18,043 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-25 03:35:18,326 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:35:18,326 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2025-04-25 03:35:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:35:18,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:35:18,649 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:35:18,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 232 [2025-04-25 03:35:19,018 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:35:19,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 227 [2025-04-25 03:35:19,030 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:35:19,031 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 134 [2025-04-25 03:35:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:35:19,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307220183] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 03:35:19,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 03:35:19,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-04-25 03:35:19,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233729785] [2025-04-25 03:35:19,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 03:35:19,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-25 03:35:19,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:35:19,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-25 03:35:19,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-04-25 03:35:19,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:19,227 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:35:19,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 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-25 03:35:19,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:19,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:19,227 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:19,228 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:19,228 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:19,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:19,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:19,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:19,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:19,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:35:19,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-25 03:35:19,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:35:19,806 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 03:35:19,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:35:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1470951831, now seen corresponding path program 2 times [2025-04-25 03:35:19,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:35:19,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27840480] [2025-04-25 03:35:19,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 03:35:19,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:35:19,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-25 03:35:19,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-25 03:35:19,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-25 03:35:19,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:35:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:35:20,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27840480] [2025-04-25 03:35:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27840480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:35:20,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:35:20,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-25 03:35:20,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203622198] [2025-04-25 03:35:20,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:35:20,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-25 03:35:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:35:20,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-25 03:35:20,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-25 03:35:20,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:20,294 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:35:20,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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-25 03:35:20,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:20,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:20,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:20,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:20,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:35:20,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:20,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:20,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:20,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:20,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:20,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:35:20,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 03:35:20,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-25 03:35:20,491 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 03:35:20,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:35:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1648941200, now seen corresponding path program 3 times [2025-04-25 03:35:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:35:20,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671148902] [2025-04-25 03:35:20,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 03:35:20,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:35:20,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-25 03:35:20,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 03:35:20,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 03:35:20,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 03:35:20,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:35:20,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671148902] [2025-04-25 03:35:20,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671148902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:35:20,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:35:20,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-25 03:35:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785551379] [2025-04-25 03:35:20,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:35:20,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 03:35:20,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:35:20,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 03:35:20,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-25 03:35:20,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:20,607 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:35:20,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 03:35:20,607 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:20,607 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:20,607 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:20,607 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:20,607 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:35:20,607 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-25 03:35:20,607 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:20,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:20,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:20,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:20,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:20,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:35:20,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 03:35:20,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 03:35:20,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-25 03:35:20,776 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 03:35:20,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:35:20,777 INFO L85 PathProgramCache]: Analyzing trace with hash -964864715, now seen corresponding path program 1 times [2025-04-25 03:35:20,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:35:20,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647288557] [2025-04-25 03:35:20,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:35:20,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:35:20,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-25 03:35:20,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 03:35:20,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:35:20,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:35:20,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:35:20,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647288557] [2025-04-25 03:35:20,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647288557] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:35:20,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069881194] [2025-04-25 03:35:20,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:35:20,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:35:20,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:35:20,921 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-25 03:35:20,923 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-25 03:35:20,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-25 03:35:21,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-25 03:35:21,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:35:21,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:21,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-25 03:35:21,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:35:21,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:35:21,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:35:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:35:21,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069881194] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-25 03:35:21,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:35:21,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2025-04-25 03:35:21,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72550794] [2025-04-25 03:35:21,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:35:21,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 03:35:21,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:35:21,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 03:35:21,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-04-25 03:35:21,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:21,157 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:35:21,157 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 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-25 03:35:21,157 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:21,157 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:21,157 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:21,157 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:21,158 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:35:21,158 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-25 03:35:21,158 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 03:35:21,158 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:21,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:21,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:21,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:21,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:21,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:35:21,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 03:35:21,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 03:35:21,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:35:21,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-25 03:35:21,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:35:21,444 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 03:35:21,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:35:21,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1509738285, now seen corresponding path program 4 times [2025-04-25 03:35:21,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:35:21,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981696680] [2025-04-25 03:35:21,446 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 03:35:21,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:35:21,453 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-25 03:35:21,459 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 03:35:21,459 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 03:35:21,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-25 03:35:21,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:35:21,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981696680] [2025-04-25 03:35:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981696680] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:35:21,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446239741] [2025-04-25 03:35:21,583 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 03:35:21,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:35:21,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:35:21,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:35:21,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-25 03:35:21,633 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-25 03:35:21,657 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-25 03:35:21,658 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-25 03:35:21,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:21,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-25 03:35:21,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:35:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-25 03:35:21,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:35:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-25 03:35:21,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446239741] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-25 03:35:21,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-25 03:35:21,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 17 [2025-04-25 03:35:21,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228631756] [2025-04-25 03:35:21,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:35:21,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-25 03:35:21,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:35:21,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-25 03:35:21,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-04-25 03:35:21,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:21,851 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:35:21,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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-25 03:35:21,851 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:21,851 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:21,851 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:21,851 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:21,851 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:35:21,851 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-25 03:35:21,852 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 03:35:21,852 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:35:21,852 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:35:21,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:35:21,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:21,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 03:35:21,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:35:21,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 03:35:21,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 03:35:21,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 03:35:21,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 03:35:21,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 03:35:21,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-25 03:35:22,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-25 03:35:22,189 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 03:35:22,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:35:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1936427052, now seen corresponding path program 5 times [2025-04-25 03:35:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:35:22,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316601842] [2025-04-25 03:35:22,189 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 03:35:22,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:35:22,198 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-25 03:35:22,225 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-25 03:35:22,225 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 03:35:22,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:35:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:35:23,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316601842] [2025-04-25 03:35:23,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316601842] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:35:23,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198751735] [2025-04-25 03:35:23,701 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 03:35:23,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:35:23,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:35:23,703 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 03:35:23,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-25 03:35:23,761 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-25 03:35:23,791 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-25 03:35:23,791 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 03:35:23,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:35:23,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-25 03:35:23,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:35:23,987 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-25 03:35:24,610 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:35:24,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-25 03:35:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 03:35:24,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 03:35:25,163 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:35:25,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1784 treesize of output 1600 [2025-04-25 03:35:30,391 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 03:35:30,393 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 03:35:30,403 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 03:35:30,406 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-25 03:35:30,599 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:35:30,600 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 3971 treesize of output 2161 [2025-04-25 03:35:33,266 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-25 03:35:33,314 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-25 03:35:33,427 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:33,796 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:35:34,787 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-25 03:35:34,885 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-25 03:35:34,976 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-25 03:35:35,077 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-25 03:35:35,306 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-25 03:35:35,426 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-25 03:35:35,611 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-25 03:35:35,700 WARN L656 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-04-25 03:35:35,850 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:35:35,928 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:35,986 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-25 03:35:36,049 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-25 03:35:36,106 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-25 03:35:36,492 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-25 03:35:36,519 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-25 03:35:36,637 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-25 03:35:36,666 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-25 03:35:36,869 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:35:36,997 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:35:37,105 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:35:37,172 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:37,634 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-25 03:35:37,780 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:37,874 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:35:37,977 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:35:38,818 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:35:38,960 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-25 03:35:39,026 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-25 03:35:39,108 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-25 03:35:39,317 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:35:39,444 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:39,825 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:39,946 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-25 03:35:39,975 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-25 03:35:40,108 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-25 03:35:40,137 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-25 03:35:40,279 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:40,708 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-25 03:35:40,774 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-25 03:35:40,891 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:35:40,955 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:35:41,049 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:35:41,948 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:35:42,055 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:42,406 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:35:42,475 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:42,587 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:35:42,649 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:35:42,738 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:35:42,876 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:35:47,469 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:35:49,536 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:35:49,651 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:35:49,728 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:35:49,823 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:35:49,874 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:35:49,963 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:35:50,047 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:35:51,999 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-25 03:35:52,099 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-25 03:35:52,244 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:52,309 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:52,688 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:35:52,769 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:35:52,881 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-25 03:35:53,007 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:35:53,406 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:35:53,479 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:35:54,352 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:35:54,491 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:35:54,676 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:35:59,392 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:35:59,528 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:35:59,638 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:36:01,633 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:36:01,708 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:36:01,776 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:36:01,871 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:36:02,011 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:36:06,589 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:36:06,703 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:36:06,946 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:36:07,014 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:36:07,193 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:36:31,575 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:36:31,673 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-04-25 03:36:31,815 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:36:56,210 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:36:56,685 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:37:07,326 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:37:07,470 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:37:18,046 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:37:18,315 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:37:22,720 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:37:22,828 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:37:23,647 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:37:23,884 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:37:25,876 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:37:27,808 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:37:32,197 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:37:32,266 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:37:42,762 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:37:43,011 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:37:43,129 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:37:43,300 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:37:43,361 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:37:43,509 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:37:43,594 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:37:43,706 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:37:43,784 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:37:44,640 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:37:44,744 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:37:44,812 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:37:44,879 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:37:44,977 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:37:46,910 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:37:47,093 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:37:47,216 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:37:47,555 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:37:47,684 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:37:49,616 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:37:49,716 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:37:49,797 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:37:50,646 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:37:50,707 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:37:51,151 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-25 03:37:51,329 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:37:52,161 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:38:02,909 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:38:03,069 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:07,754 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:12,421 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:38:12,570 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:14,578 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:38:15,439 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:17,464 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:17,590 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:17,676 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:19,696 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:38:20,573 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:20,656 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:22,655 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:27,361 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:38:27,499 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:38:27,910 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:38:28,784 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:28,911 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:38:29,271 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:38:29,333 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-25 03:38:29,499 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:38:29,872 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:29,942 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:38:30,811 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:32,908 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:32,993 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:38:33,870 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:38:34,246 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:38:35,128 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:35,482 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-25 03:38:35,630 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:38:35,714 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:38:35,788 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:35,883 WARN L656 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-04-25 03:38:35,993 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:38:36,898 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:38,927 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:43,575 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:38:43,747 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:43,857 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:38:44,705 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:44,871 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:44,954 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:45,055 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:47,050 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:38:47,422 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:38:47,552 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:38:47,935 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-25 03:38:48,185 WARN L656 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-04-25 03:38:48,357 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:38:48,764 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:38:48,949 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:38:49,459 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:51,498 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:56,167 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:38:56,254 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:56,369 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:38:56,440 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:56,547 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:38:56,822 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:38:58,831 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:39:03,459 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:39:03,578 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:39:03,744 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:39:04,002 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-04-25 03:39:04,135 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:39:28,737 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:39:29,085 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-04-25 03:39:29,603 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:40:25,393 WARN L656 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2025-04-25 03:40:25,548 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-04-25 03:40:25,665 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:41:21,486 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:41:45,731 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-04-25 03:41:45,838 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:41:45,920 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:41:46,005 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:41:46,099 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:41:46,190 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:41:57,049 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:41:57,231 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:41:57,293 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:41:57,411 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:02,192 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:42:02,258 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:42:03,122 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:42:05,101 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:05,202 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:42:06,144 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:42:06,311 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:06,425 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:06,519 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:42:08,679 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:08,777 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:42:10,817 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:15,455 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:15,587 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:42:15,692 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:15,771 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:42:15,859 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:42:16,707 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:16,776 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:16,860 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:42:17,014 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:42:17,125 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:17,308 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:27,691 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:42:27,783 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:42:28,077 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-04-25 03:42:28,293 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:42:28,571 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:42:28,659 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:42:29,122 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:42:29,981 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:42:30,091 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:30,208 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:30,357 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:42:30,709 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:42:31,559 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:42:31,700 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:42:32,094 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:42:32,463 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:42:32,550 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:42:32,644 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:32,739 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:42:34,793 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:42:34,891 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:34,987 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:42:36,952 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:37,030 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:37,087 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:42:37,939 WARN L656 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-04-25 03:42:38,018 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:42:38,149 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:38,234 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:42:38,491 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:42:38,624 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:38,762 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:43,306 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:42:43,409 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:43,574 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:43,880 WARN L656 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-04-25 03:42:44,154 WARN L656 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-04-25 03:42:45,012 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:45,169 WARN L656 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2025-04-25 03:42:45,339 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:45,419 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:42:45,574 WARN L656 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2025-04-25 03:42:56,341 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-04-25 03:42:56,444 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:42:56,526 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:42:56,812 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:43:21,221 WARN L656 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2025-04-25 03:43:21,346 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:43:21,470 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-04-25 03:43:21,961 WARN L656 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2025-04-25 03:43:22,070 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2025-04-25 03:43:22,172 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:43:22,572 WARN L656 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2025-04-25 03:44:18,338 WARN L656 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2025-04-25 03:44:18,452 WARN L656 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2025-04-25 03:44:19,479 WARN L656 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts.