./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.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/chl-node-subst.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 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --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:01:14,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 03:01:14,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 03:01:14,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 03:01:14,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 03:01:14,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 03:01:14,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 03:01:14,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 03:01:14,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 03:01:14,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 03:01:14,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 03:01:14,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 03:01:14,745 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 03:01:14,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 03:01:14,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 03:01:14,745 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 03:01:14,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 03:01:14,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 03:01:14,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 03:01:14,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 03:01:14,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 03:01:14,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 03:01:14,747 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 03:01:14,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 03:01:14,747 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 03:01:14,747 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 03:01:14,747 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 03:01:14,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 03:01:14,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 03:01:14,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:01:14,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:01:14,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 03:01:14,748 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 03:01:14,749 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 03:01:14,749 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 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:01:14,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 03:01:14,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 03:01:14,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 03:01:14,990 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 03:01:14,990 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 03:01:14,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-04-25 03:01:16,410 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2cfd3db50/3757ee09517f47119c93e6aef2bbf44b/FLAG4d2580c4f [2025-04-25 03:01:16,645 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 03:01:16,645 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-04-25 03:01:16,665 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2cfd3db50/3757ee09517f47119c93e6aef2bbf44b/FLAG4d2580c4f [2025-04-25 03:01:17,410 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2cfd3db50/3757ee09517f47119c93e6aef2bbf44b [2025-04-25 03:01:17,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 03:01:17,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 03:01:17,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 03:01:17,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 03:01:17,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 03:01:17,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a8ce717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17, skipping insertion in model container [2025-04-25 03:01:17,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 03:01:17,621 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/chl-node-subst.wvr.c[4035,4048] [2025-04-25 03:01:17,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 03:01:17,652 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 03:01:17,694 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/chl-node-subst.wvr.c[4035,4048] [2025-04-25 03:01:17,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 03:01:17,714 INFO L204 MainTranslator]: Completed translation [2025-04-25 03:01:17,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17 WrapperNode [2025-04-25 03:01:17,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 03:01:17,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 03:01:17,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 03:01:17,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 03:01:17,722 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:01:17" (1/1) ... [2025-04-25 03:01:17,737 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:01:17" (1/1) ... [2025-04-25 03:01:17,770 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 406 [2025-04-25 03:01:17,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 03:01:17,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 03:01:17,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 03:01:17,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 03:01:17,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,789 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,800 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 03:01:17,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 03:01:17,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 03:01:17,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 03:01:17,809 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17" (1/1) ... [2025-04-25 03:01:17,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 03:01:17,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:01:17,835 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:01:17,837 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:01:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 03:01:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-25 03:01:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-25 03:01:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 03:01:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 03:01:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 03:01:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 03:01:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-25 03:01:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-25 03:01:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 03:01:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-25 03:01:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 03:01:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 03:01:17,857 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:01:17,972 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 03:01:17,973 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 03:01:18,447 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 03:01:18,447 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 03:01:18,908 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 03:01:18,908 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 03:01:18,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 03:01:18 BoogieIcfgContainer [2025-04-25 03:01:18,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 03:01:18,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 03:01:18,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 03:01:18,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 03:01:18,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 03:01:17" (1/3) ... [2025-04-25 03:01:18,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfd5334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 03:01:18, skipping insertion in model container [2025-04-25 03:01:18,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 03:01:17" (2/3) ... [2025-04-25 03:01:18,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfd5334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 03:01:18, skipping insertion in model container [2025-04-25 03:01:18,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 03:01:18" (3/3) ... [2025-04-25 03:01:18,917 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-04-25 03:01:18,927 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 03:01:18,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 26 locations, 28 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-25 03:01:18,929 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 03:01:18,987 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-25 03:01:19,019 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 03:01:19,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 03:01:19,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:01:19,023 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:01:19,025 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:01:19,108 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 03:01:19,116 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 03:01:19,122 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;@7eb2ed34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 03:01:19,122 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-25 03:01:19,231 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:01:19,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:01:19,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1270709395, now seen corresponding path program 1 times [2025-04-25 03:01:19,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:01:19,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676492581] [2025-04-25 03:01:19,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:01:19,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:01:19,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-25 03:01:19,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-25 03:01:19,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:01:19,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:01:19,805 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:01:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:01:19,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676492581] [2025-04-25 03:01:19,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676492581] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:01:19,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:01:19,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-25 03:01:19,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624719811] [2025-04-25 03:01:19,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:01:19,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 03:01:19,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:01:19,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 03:01:19,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 03:01:19,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:19,828 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:01:19,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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:01:19,829 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:19,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:01:19,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 03:01:19,906 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:01:19,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:01:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1689598028, now seen corresponding path program 1 times [2025-04-25 03:01:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:01:19,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780188585] [2025-04-25 03:01:19,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:01:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:01:19,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-25 03:01:19,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-25 03:01:19,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:01:19,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:01:20,119 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:01:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:01:20,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780188585] [2025-04-25 03:01:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780188585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:01:20,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:01:20,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 03:01:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718795068] [2025-04-25 03:01:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:01:20,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 03:01:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:01:20,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 03:01:20,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 03:01:20,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:20,123 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:01:20,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 03:01:20,123 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:01:20,123 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:20,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:01:20,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:20,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 03:01:20,189 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:01:20,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:01:20,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1427418846, now seen corresponding path program 1 times [2025-04-25 03:01:20,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:01:20,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312972138] [2025-04-25 03:01:20,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:01:20,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:01:20,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 03:01:20,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 03:01:20,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:01:20,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:01:20,423 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:01:20,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:01:20,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312972138] [2025-04-25 03:01:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312972138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:01:20,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:01:20,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 03:01:20,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408168128] [2025-04-25 03:01:20,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:01:20,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 03:01:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:01:20,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 03:01:20,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 03:01:20,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:20,425 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:01:20,425 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:01:20,425 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:01:20,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:20,426 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:20,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:01:20,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:20,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:20,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 03:01:20,483 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:01:20,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:01:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1553582512, now seen corresponding path program 1 times [2025-04-25 03:01:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:01:20,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279085461] [2025-04-25 03:01:20,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:01:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:01:20,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-25 03:01:20,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 03:01:20,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:01:20,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:01:20,730 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:01:20,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:01:20,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279085461] [2025-04-25 03:01:20,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279085461] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:01:20,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079821941] [2025-04-25 03:01:20,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:01:20,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:01:20,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:01:20,732 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:01:20,734 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:01:20,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-25 03:01:20,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 03:01:20,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:01:20,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:01:20,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-25 03:01:20,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:01:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-25 03:01:20,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 03:01:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079821941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:01:20,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-25 03:01:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-04-25 03:01:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699761322] [2025-04-25 03:01:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:01:20,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 03:01:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:01:20,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 03:01:20,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-25 03:01:20,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:20,946 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:01:20,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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:01:20,946 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:01:20,946 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:20,946 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:20,946 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:21,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:01:21,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,026 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:01:21,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:01:21,223 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:01:21,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:01:21,223 INFO L85 PathProgramCache]: Analyzing trace with hash -671855362, now seen corresponding path program 1 times [2025-04-25 03:01:21,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:01:21,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230942467] [2025-04-25 03:01:21,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:01:21,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:01:21,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 03:01:21,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 03:01:21,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:01:21,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:01:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-25 03:01:21,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:01:21,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230942467] [2025-04-25 03:01:21,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230942467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:01:21,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 03:01:21,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 03:01:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502155515] [2025-04-25 03:01:21,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:01:21,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 03:01:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:01:21,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 03:01:21,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-25 03:01:21,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:21,407 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:01:21,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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:01:21,408 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:01:21,408 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,408 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,408 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,408 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:21,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:01:21,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-25 03:01:21,469 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:01:21,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:01:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1524868196, now seen corresponding path program 1 times [2025-04-25 03:01:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:01:21,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163720368] [2025-04-25 03:01:21,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:01:21,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:01:21,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-25 03:01:21,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 03:01:21,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:01:21,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:01:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-25 03:01:21,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:01:21,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163720368] [2025-04-25 03:01:21,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163720368] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:01:21,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695550052] [2025-04-25 03:01:21,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:01:21,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:01:21,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:01:21,710 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:01:21,712 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:01:21,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-25 03:01:21,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 03:01:21,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:01:21,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:01:21,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-25 03:01:21,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:01:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-25 03:01:21,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 03:01:21,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695550052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 03:01:21,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-25 03:01:21,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-04-25 03:01:21,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465567634] [2025-04-25 03:01:21,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 03:01:21,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 03:01:21,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 03:01:21,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 03:01:21,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-25 03:01:21,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:21,883 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 03:01:21,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 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:01:21,884 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:01:21,884 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,884 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,884 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,884 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,884 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 03:01:21,947 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 03:01:21,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 03:01:21,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-25 03:01:22,153 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:01:22,153 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:01:22,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 03:01:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1707518308, now seen corresponding path program 1 times [2025-04-25 03:01:22,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 03:01:22,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761566445] [2025-04-25 03:01:22,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:01:22,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 03:01:22,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-25 03:01:22,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 03:01:22,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:01:22,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:01:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-25 03:01:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 03:01:25,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761566445] [2025-04-25 03:01:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761566445] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 03:01:25,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105961414] [2025-04-25 03:01:25,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 03:01:25,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 03:01:25,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 03:01:25,489 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:01:25,491 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:01:25,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-25 03:01:25,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-25 03:01:25,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 03:01:25,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 03:01:25,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-25 03:01:25,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 03:01:31,740 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (.cse11 (= (mod (select (select |c_#memory_int| c_~contains_key_7~0.base) (+ c_~id_6~0 c_~contains_key_7~0.offset)) 256) 0)) (.cse4 (select (select |c_#memory_int| c_~get_8~0.base) (+ (* c_~id_6~0 4) c_~get_8~0.offset)))) (let ((.cse17 (= (+ c_~result_12~0 1) 0)) (.cse16 (= c_~result_12~0 0)) (.cse23 (+ .cse4 1)) (.cse21 (= c_~result_12~0 1)) (.cse12 (not .cse11)) (.cse29 (+ 2147483647 .cse8)) (.cse2 (+ .cse4 2147483647)) (.cse3 (+ .cse4 c_~result_12~0)) (.cse30 (+ .cse8 c_~result_9~0)) (.cse26 (= (mod (select (select |c_#memory_int| c_~contains_key_4~0.base) (+ c_~contains_key_4~0.offset c_~id_3~0)) 256) 0))) (or (and (let ((.cse10 (= c_~result_9~0 0)) (.cse0 (+ .cse8 1)) (.cse5 (= c_~result_9~0 1)) (.cse6 (= (+ c_~result_9~0 1) 0))) (or (and (or (and (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse1 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (<= .cse0 .cse1) (<= .cse1 .cse2) (= .cse3 .cse1) (<= .cse4 (+ .cse1 2147483648))))) .cse5) (and .cse6 (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse7 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (<= (+ .cse7 1) .cse8) (<= .cse7 .cse2) (= .cse3 .cse7) (<= .cse4 (+ .cse7 2147483648)))))) (and (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse9 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (= .cse9 .cse8) (<= .cse9 .cse2) (= .cse3 .cse9) (<= .cse4 (+ .cse9 2147483648))))) .cse10)) .cse11) (and .cse12 (or (and (or (and .cse6 (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse13 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (<= (+ .cse13 1) .cse8) (= .cse4 .cse13))))) (and (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse14 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (= .cse4 .cse14) (= .cse14 .cse8)))) .cse10) (and (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse15 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (= .cse4 .cse15) (<= .cse0 .cse15)))) .cse5)) .cse16) (and .cse17 (or (and .cse6 (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse18 (+ (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)) 1))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (<= .cse18 .cse8) (<= .cse18 .cse4))))) (and .cse5 (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse19 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (<= .cse0 .cse19) (<= (+ .cse19 1) .cse4))))) (and (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse20 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (= .cse20 .cse8) (<= (+ .cse20 1) .cse4)))) .cse10))) (and .cse21 (or (and .cse10 (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse22 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (= .cse22 .cse8) (<= .cse23 .cse22))))) (and (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse24 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (<= .cse0 .cse24) (<= .cse23 .cse24)))) .cse5) (and .cse6 (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse25 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (<= (+ .cse25 1) .cse8) (<= .cse23 .cse25))))))))))) (not .cse26)) (exists ((~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (and (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0) (exists ((~get_2~0.base Int) (~get_2~0.offset Int)) (let ((.cse28 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (let ((.cse27 (+ .cse28 2147483648))) (and (<= .cse8 .cse27) (<= .cse28 .cse29) (<= .cse28 .cse2) (= .cse3 .cse28) (= .cse30 .cse28) (<= .cse4 .cse27))))))) (and (or (and (or (and (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse31 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (<= .cse8 (+ .cse31 2147483648)) (<= .cse31 .cse29) (<= (+ .cse31 1) .cse4) (= .cse30 .cse31)))) .cse17) (and (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse32 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (<= .cse8 (+ .cse32 2147483648)) (= .cse4 .cse32) (<= .cse32 .cse29) (= .cse30 .cse32)))) .cse16) (and (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~contains_key_1~0.offset Int) (~id_0~0 Int) (~contains_key_1~0.base Int)) (let ((.cse33 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (and (not (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (<= .cse8 (+ .cse33 2147483648)) (<= .cse33 .cse29) (<= .cse23 .cse33) (= .cse30 .cse33)))) .cse21)) .cse12) (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~id_0~0 Int)) (let ((.cse35 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (let ((.cse34 (+ .cse35 2147483648))) (and (<= .cse8 .cse34) (<= .cse35 .cse29) (<= .cse35 .cse2) (= .cse3 .cse35) (exists ((~contains_key_1~0.offset Int) (~contains_key_1~0.base Int)) (= (mod (select (select |c_#memory_int| ~contains_key_1~0.base) (+ ~id_0~0 ~contains_key_1~0.offset)) 256) 0)) (= .cse30 .cse35) (<= .cse4 .cse34))))) (and (exists ((~get_2~0.base Int) (~get_2~0.offset Int) (~id_0~0 Int)) (let ((.cse37 (select (select |c_#memory_int| ~get_2~0.base) (+ (* ~id_0~0 4) ~get_2~0.offset)))) (let ((.cse36 (+ .cse37 2147483648))) (and (<= .cse8 .cse36) (<= .cse37 .cse29) (<= .cse37 .cse2) (= .cse3 .cse37) (= .cse30 .cse37) (<= .cse4 .cse36))))) .cse11)) .cse26)))) is different from true [2025-04-25 03:09:06,860 WARN L286 SmtUtils]: Spent 7.47m on a formula simplification that was a NOOP. DAG size: 4683 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-04-25 03:09:06,862 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 03:09:06,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 39 select indices, 39 select index equivalence classes, 0 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 741 case distinctions, treesize of input 1877 treesize of output 14019