./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:39:01,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:39:01,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:39:01,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:39:01,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:39:01,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:39:01,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:39:01,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:39:01,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:39:01,973 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:39:01,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:39:01,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:39:01,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:39:01,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:39:01,973 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:39:01,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:39:01,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:39:01,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:39:01,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:39:01,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:39:01,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:39:01,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:01,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:39:01,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:39:01,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:39:01,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:39:01,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:01,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:39:01,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:39:01,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:39:01,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:39:01,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:39:01,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:39:01,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:39:01,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:39:01,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:39:01,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:39:01,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-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 -> Automizer 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 [2025-01-09 16:39:02,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:39:02,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:39:02,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:39:02,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:39:02,150 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:39:02,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-01-09 16:39:03,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8779415c6/b15f55be2cca43dda50c799feadb72f5/FLAG4f33ed70b [2025-01-09 16:39:03,519 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:39:03,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-01-09 16:39:03,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8779415c6/b15f55be2cca43dda50c799feadb72f5/FLAG4f33ed70b [2025-01-09 16:39:03,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8779415c6/b15f55be2cca43dda50c799feadb72f5 [2025-01-09 16:39:03,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:39:03,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:39:03,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:39:03,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:39:03,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:39:03,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355ec936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:03, skipping insertion in model container [2025-01-09 16:39:03,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:03" (1/1) ... [2025-01-09 16:39:03,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:39:03,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c[4035,4048] [2025-01-09 16:39:03,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:39:03,994 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:39:04,020 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c[4035,4048] [2025-01-09 16:39:04,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:39:04,043 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:39:04,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04 WrapperNode [2025-01-09 16:39:04,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:39:04,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:39:04,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:39:04,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:39:04,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,095 INFO L138 Inliner]: procedures = 26, calls = 51, calls flagged for inlining = 22, calls inlined = 34, statements flattened = 406 [2025-01-09 16:39:04,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:39:04,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:39:04,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:39:04,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:39:04,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,128 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-01-09 16:39:04,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:39:04,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:39:04,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:39:04,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:39:04,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (1/1) ... [2025-01-09 16:39:04,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:04,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:04,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:39:04,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:39:04,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:39:04,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:39:04,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:39:04,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:39:04,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:39:04,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:39:04,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:39:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:39:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:39:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:39:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:39:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:39:04,219 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:39:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:39:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:39:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:39:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:39:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:39:04,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:39:04,220 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:39:04,320 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:39:04,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:39:04,727 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:39:04,727 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:39:05,142 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:39:05,142 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:39:05,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:05 BoogieIcfgContainer [2025-01-09 16:39:05,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:39:05,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:39:05,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:39:05,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:39:05,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:39:03" (1/3) ... [2025-01-09 16:39:05,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2079b43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:05, skipping insertion in model container [2025-01-09 16:39:05,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:04" (2/3) ... [2025-01-09 16:39:05,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2079b43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:05, skipping insertion in model container [2025-01-09 16:39:05,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:05" (3/3) ... [2025-01-09 16:39:05,150 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-01-09 16:39:05,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:39:05,162 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:39:05,163 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:39:05,254 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:39:05,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 83 flow [2025-01-09 16:39:05,316 INFO L124 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-01-09 16:39:05,319 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:39:05,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 13 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-01-09 16:39:05,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 31 transitions, 83 flow [2025-01-09 16:39:05,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 72 flow [2025-01-09 16:39:05,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:39:05,336 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, 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;@ea1685c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:39:05,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:39:05,353 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:39:05,354 INFO L124 PetriNetUnfolderBase]: 6/26 cut-off events. [2025-01-09 16:39:05,354 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:39:05,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:05,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:05,355 INFO L396 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-01-09 16:39:05,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash 407150355, now seen corresponding path program 1 times [2025-01-09 16:39:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:05,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827449030] [2025-01-09 16:39:05,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:05,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:05,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:39:05,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:39:05,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:05,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:39:05,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:05,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827449030] [2025-01-09 16:39:05,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827449030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:05,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:05,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:39:05,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893238434] [2025-01-09 16:39:05,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:05,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:39:05,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:05,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:39:05,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:39:05,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:39:05,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:05,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:05,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:39:05,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:06,021 INFO L124 PetriNetUnfolderBase]: 38/83 cut-off events. [2025-01-09 16:39:06,021 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:39:06,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 83 events. 38/83 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 32 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 120. Up to 82 conditions per place. [2025-01-09 16:39:06,024 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 25 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-01-09 16:39:06,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 128 flow [2025-01-09 16:39:06,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:39:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:39:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-01-09 16:39:06,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2025-01-09 16:39:06,037 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 72 flow. Second operand 3 states and 40 transitions. [2025-01-09 16:39:06,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 128 flow [2025-01-09 16:39:06,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 28 transitions, 116 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:39:06,042 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 72 flow [2025-01-09 16:39:06,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2025-01-09 16:39:06,046 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-01-09 16:39:06,047 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 72 flow [2025-01-09 16:39:06,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:06,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:06,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:06,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:39:06,048 INFO L396 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-01-09 16:39:06,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1689598028, now seen corresponding path program 1 times [2025-01-09 16:39:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:06,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068211345] [2025-01-09 16:39:06,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:06,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:06,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:39:06,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:39:06,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:06,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:39:06,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:06,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068211345] [2025-01-09 16:39:06,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068211345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:06,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:06,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:39:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624003692] [2025-01-09 16:39:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:06,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:06,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:06,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:06,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:39:06,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:39:06,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:06,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:06,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:39:06,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:06,387 INFO L124 PetriNetUnfolderBase]: 38/84 cut-off events. [2025-01-09 16:39:06,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:39:06,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 84 events. 38/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 32 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 172. Up to 81 conditions per place. [2025-01-09 16:39:06,390 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 24 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2025-01-09 16:39:06,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 130 flow [2025-01-09 16:39:06,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:39:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:39:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-01-09 16:39:06,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2025-01-09 16:39:06,392 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 72 flow. Second operand 4 states and 45 transitions. [2025-01-09 16:39:06,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 130 flow [2025-01-09 16:39:06,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 126 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:06,394 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 86 flow [2025-01-09 16:39:06,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-01-09 16:39:06,396 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2025-01-09 16:39:06,396 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 86 flow [2025-01-09 16:39:06,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:06,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:06,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:06,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:39:06,397 INFO L396 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-01-09 16:39:06,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1427418846, now seen corresponding path program 1 times [2025-01-09 16:39:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:06,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590117456] [2025-01-09 16:39:06,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:06,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:06,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:39:06,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:39:06,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:06,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:39:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:06,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590117456] [2025-01-09 16:39:06,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590117456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:06,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:06,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:39:06,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568596874] [2025-01-09 16:39:06,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:06,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:06,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:06,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:06,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:39:06,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:39:06,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:06,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:06,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:39:06,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:06,714 INFO L124 PetriNetUnfolderBase]: 38/85 cut-off events. [2025-01-09 16:39:06,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:39:06,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 85 events. 38/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 32 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 172. Up to 83 conditions per place. [2025-01-09 16:39:06,715 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 26 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2025-01-09 16:39:06,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 146 flow [2025-01-09 16:39:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:39:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:39:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-01-09 16:39:06,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-01-09 16:39:06,716 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 86 flow. Second operand 4 states and 44 transitions. [2025-01-09 16:39:06,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 146 flow [2025-01-09 16:39:06,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:06,717 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 99 flow [2025-01-09 16:39:06,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-01-09 16:39:06,718 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2025-01-09 16:39:06,718 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 99 flow [2025-01-09 16:39:06,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:06,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:06,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:06,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:39:06,718 INFO L396 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-01-09 16:39:06,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1553582512, now seen corresponding path program 1 times [2025-01-09 16:39:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:06,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985097953] [2025-01-09 16:39:06,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:06,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:39:06,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:39:06,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:06,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:39:06,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:06,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985097953] [2025-01-09 16:39:06,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985097953] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:06,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841934328] [2025-01-09 16:39:06,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:06,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:06,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:06,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:39:06,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:39:07,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:39:07,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:39:07,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:07,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:07,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:39:07,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:39:07,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:39:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841934328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:07,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:39:07,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 16:39:07,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117613454] [2025-01-09 16:39:07,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:07,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:07,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:07,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:07,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:39:07,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:39:07,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:07,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:07,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:39:07,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:07,252 INFO L124 PetriNetUnfolderBase]: 38/86 cut-off events. [2025-01-09 16:39:07,252 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:39:07,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 86 events. 38/86 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 32 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 179. Up to 84 conditions per place. [2025-01-09 16:39:07,254 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-01-09 16:39:07,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 161 flow [2025-01-09 16:39:07,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:39:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:39:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-01-09 16:39:07,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-01-09 16:39:07,256 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 99 flow. Second operand 4 states and 44 transitions. [2025-01-09 16:39:07,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 161 flow [2025-01-09 16:39:07,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 155 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:07,258 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 107 flow [2025-01-09 16:39:07,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-01-09 16:39:07,258 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2025-01-09 16:39:07,258 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 107 flow [2025-01-09 16:39:07,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:07,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:07,258 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:07,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:39:07,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:07,463 INFO L396 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-01-09 16:39:07,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash -671855362, now seen corresponding path program 1 times [2025-01-09 16:39:07,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:07,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931130606] [2025-01-09 16:39:07,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:07,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:39:07,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:39:07,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:07,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:39:07,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:07,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931130606] [2025-01-09 16:39:07,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931130606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:07,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:07,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:39:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894490030] [2025-01-09 16:39:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:07,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:07,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:07,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:07,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:39:07,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:39:07,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:07,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:07,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:39:07,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:07,735 INFO L124 PetriNetUnfolderBase]: 38/87 cut-off events. [2025-01-09 16:39:07,736 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:39:07,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 87 events. 38/87 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 32 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 184. Up to 85 conditions per place. [2025-01-09 16:39:07,736 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 28 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-01-09 16:39:07,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 171 flow [2025-01-09 16:39:07,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:39:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:39:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-01-09 16:39:07,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-01-09 16:39:07,738 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 107 flow. Second operand 4 states and 44 transitions. [2025-01-09 16:39:07,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 171 flow [2025-01-09 16:39:07,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 165 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:07,740 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 115 flow [2025-01-09 16:39:07,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-01-09 16:39:07,740 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2025-01-09 16:39:07,741 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 115 flow [2025-01-09 16:39:07,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:07,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:07,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:07,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:39:07,741 INFO L396 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-01-09 16:39:07,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:07,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1524868196, now seen corresponding path program 1 times [2025-01-09 16:39:07,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:07,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323668167] [2025-01-09 16:39:07,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:07,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:39:07,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:39:07,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:07,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 16:39:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:07,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323668167] [2025-01-09 16:39:07,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323668167] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:07,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717223874] [2025-01-09 16:39:07,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:07,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:07,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:07,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:39:07,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:39:08,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:39:08,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:39:08,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:08,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:08,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:39:08,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:39:08,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:39:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717223874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:08,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:39:08,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 16:39:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730417808] [2025-01-09 16:39:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:08,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:08,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:08,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:08,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:39:08,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2025-01-09 16:39:08,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:08,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:08,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2025-01-09 16:39:08,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:08,168 INFO L124 PetriNetUnfolderBase]: 38/88 cut-off events. [2025-01-09 16:39:08,168 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:39:08,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 88 events. 38/88 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 32 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 189. Up to 86 conditions per place. [2025-01-09 16:39:08,168 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 29 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-01-09 16:39:08,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 181 flow [2025-01-09 16:39:08,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:39:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:39:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-01-09 16:39:08,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2025-01-09 16:39:08,169 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 115 flow. Second operand 4 states and 44 transitions. [2025-01-09 16:39:08,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 181 flow [2025-01-09 16:39:08,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 175 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:08,170 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 123 flow [2025-01-09 16:39:08,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2025-01-09 16:39:08,175 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2025-01-09 16:39:08,175 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 123 flow [2025-01-09 16:39:08,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:08,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:08,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:08,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:39:08,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:08,376 INFO L396 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-01-09 16:39:08,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1707518308, now seen corresponding path program 1 times [2025-01-09 16:39:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:08,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517185793] [2025-01-09 16:39:08,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:08,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:39:08,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:39:08,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:08,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 16:39:11,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517185793] [2025-01-09 16:39:11,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517185793] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923857880] [2025-01-09 16:39:11,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:11,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:11,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:11,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:39:11,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:39:11,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:39:11,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:39:11,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:11,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:11,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 16:39:11,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:14,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:39:14,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 885 treesize of output 2129