./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/bench-exp2x6.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/bench-exp2x6.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 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:36:52,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:36:53,031 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:36:53,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:36:53,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:36:53,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:36:53,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:36:53,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:36:53,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:36:53,052 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:36:53,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:36:53,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:36:53,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:36:53,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:36:53,053 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:36:53,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:36:53,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:36:53,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:36:53,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:36:53,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:36:53,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:36:53,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:36:53,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:36:53,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:36:53,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:36:53,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:36:53,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:36:53,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:36:53,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:36:53,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:36:53,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:36:53,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:36:53,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:36:53,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:36:53,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:36:53,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:36:53,055 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 -> 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 [2025-01-09 16:36:53,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:36:53,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:36:53,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:36:53,285 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:36:53,285 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:36:53,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-01-09 16:36:54,439 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bbcdf091/02fbde2c937c436da87553931c0e7c1e/FLAGe81ed8c10 [2025-01-09 16:36:54,640 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:36:54,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-01-09 16:36:54,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bbcdf091/02fbde2c937c436da87553931c0e7c1e/FLAGe81ed8c10 [2025-01-09 16:36:54,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2bbcdf091/02fbde2c937c436da87553931c0e7c1e [2025-01-09 16:36:54,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:36:54,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:36:54,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:36:54,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:36:54,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:36:54,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c851df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54, skipping insertion in model container [2025-01-09 16:36:54,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:36:54,826 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/bench-exp2x6.wvr.c[2505,2518] [2025-01-09 16:36:54,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:36:54,840 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:36:54,861 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/bench-exp2x6.wvr.c[2505,2518] [2025-01-09 16:36:54,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:36:54,875 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:36:54,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54 WrapperNode [2025-01-09 16:36:54,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:36:54,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:36:54,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:36:54,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:36:54,883 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:36:54" (1/1) ... [2025-01-09 16:36:54,888 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:36:54" (1/1) ... [2025-01-09 16:36:54,898 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-01-09 16:36:54,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:36:54,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:36:54,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:36:54,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:36:54,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,926 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:36:54,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,931 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:36:54,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:36:54,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:36:54,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:36:54,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (1/1) ... [2025-01-09 16:36:54,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:36:54,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:54,972 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:36:54,980 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:36:55,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:36:55,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:36:55,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:36:55,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:36:55,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:36:55,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:36:55,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:36:55,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 16:36:55,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 16:36:55,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:36:55,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:36:55,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:36:55,010 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:36:55,080 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:36:55,081 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:36:55,257 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:36:55,257 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:36:55,341 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:36:55,342 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:36:55,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:55 BoogieIcfgContainer [2025-01-09 16:36:55,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:36:55,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:36:55,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:36:55,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:36:55,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:36:54" (1/3) ... [2025-01-09 16:36:55,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4841deca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:55, skipping insertion in model container [2025-01-09 16:36:55,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:54" (2/3) ... [2025-01-09 16:36:55,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4841deca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:55, skipping insertion in model container [2025-01-09 16:36:55,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:55" (3/3) ... [2025-01-09 16:36:55,351 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2025-01-09 16:36:55,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:36:55,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x6.wvr.c that has 5 procedures, 29 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:36:55,362 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:36:55,393 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 16:36:55,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2025-01-09 16:36:55,430 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-01-09 16:36:55,432 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:36:55,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 4/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-01-09 16:36:55,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2025-01-09 16:36:55,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 27 transitions, 78 flow [2025-01-09 16:36:55,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:36:55,447 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;@2743977b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:36:55,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:36:55,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:36:55,456 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-01-09 16:36:55,456 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:36:55,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:55,457 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:36:55,457 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 2 more)] === [2025-01-09 16:36:55,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash -2001672781, now seen corresponding path program 1 times [2025-01-09 16:36:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:55,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359731865] [2025-01-09 16:36:55,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:55,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:55,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:36:55,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:36:55,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:55,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:55,813 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:36:55,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:55,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359731865] [2025-01-09 16:36:55,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359731865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:55,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:55,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:36:55,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14101822] [2025-01-09 16:36:55,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:55,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:36:55,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:55,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:36:55,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:36:55,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-09 16:36:55,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:36:55,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:55,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-09 16:36:55,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:56,107 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2025-01-09 16:36:56,107 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-01-09 16:36:56,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5614 event pairs, 123 based on Foata normal form. 1/997 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-01-09 16:36:56,123 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2025-01-09 16:36:56,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2025-01-09 16:36:56,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:36:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:36:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-01-09 16:36:56,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-01-09 16:36:56,132 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 78 flow. Second operand 3 states and 69 transitions. [2025-01-09 16:36:56,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2025-01-09 16:36:56,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 16:36:56,138 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2025-01-09 16:36:56,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-01-09 16:36:56,141 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-01-09 16:36:56,141 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2025-01-09 16:36:56,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:36:56,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:56,141 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:36:56,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:36:56,142 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 2 more)] === [2025-01-09 16:36:56,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:56,142 INFO L85 PathProgramCache]: Analyzing trace with hash -561814947, now seen corresponding path program 1 times [2025-01-09 16:36:56,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:56,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603224675] [2025-01-09 16:36:56,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:56,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:56,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:36:56,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:56,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:56,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:56,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:56,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603224675] [2025-01-09 16:36:56,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603224675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:56,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:56,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:36:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796855091] [2025-01-09 16:36:56,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:56,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:36:56,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:56,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:36:56,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:36:56,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-09 16:36:56,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:36:56,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:56,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-09 16:36:56,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:56,531 INFO L124 PetriNetUnfolderBase]: 1581/2026 cut-off events. [2025-01-09 16:36:56,531 INFO L125 PetriNetUnfolderBase]: For 580/580 co-relation queries the response was YES. [2025-01-09 16:36:56,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5032 conditions, 2026 events. 1581/2026 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7007 event pairs, 95 based on Foata normal form. 46/2066 useless extension candidates. Maximal degree in co-relation 1272. Up to 830 conditions per place. [2025-01-09 16:36:56,542 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 65 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-01-09 16:36:56,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 80 transitions, 387 flow [2025-01-09 16:36:56,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:36:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:36:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-01-09 16:36:56,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7125 [2025-01-09 16:36:56,544 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 114 transitions. [2025-01-09 16:36:56,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 80 transitions, 387 flow [2025-01-09 16:36:56,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 80 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:36:56,546 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2025-01-09 16:36:56,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2025-01-09 16:36:56,546 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-01-09 16:36:56,546 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2025-01-09 16:36:56,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:36:56,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:56,547 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:36:56,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:36:56,547 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 2 more)] === [2025-01-09 16:36:56,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash -704866706, now seen corresponding path program 1 times [2025-01-09 16:36:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:56,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071738263] [2025-01-09 16:36:56,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:56,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:36:56,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:56,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:56,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:56,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:56,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071738263] [2025-01-09 16:36:56,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071738263] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:56,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38188038] [2025-01-09 16:36:56,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:56,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:56,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:56,612 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:36:56,612 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:36:56,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:36:56,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:56,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:56,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:56,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:36:56,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:36:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:56,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:36:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:56,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38188038] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:36:56,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:36:56,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-09 16:36:56,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283167081] [2025-01-09 16:36:56,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:36:56,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:36:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:56,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:36:56,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:36:56,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-09 16:36:56,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:36:56,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:56,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-09 16:36:56,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:57,104 INFO L124 PetriNetUnfolderBase]: 1907/2535 cut-off events. [2025-01-09 16:36:57,104 INFO L125 PetriNetUnfolderBase]: For 3307/3307 co-relation queries the response was YES. [2025-01-09 16:36:57,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7850 conditions, 2535 events. 1907/2535 cut-off events. For 3307/3307 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10053 event pairs, 284 based on Foata normal form. 64/2575 useless extension candidates. Maximal degree in co-relation 3599. Up to 1049 conditions per place. [2025-01-09 16:36:57,115 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 79 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-01-09 16:36:57,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 92 transitions, 571 flow [2025-01-09 16:36:57,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:36:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:36:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-01-09 16:36:57,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-01-09 16:36:57,116 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 108 transitions. [2025-01-09 16:36:57,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 92 transitions, 571 flow [2025-01-09 16:36:57,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 92 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:36:57,119 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 210 flow [2025-01-09 16:36:57,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-01-09 16:36:57,120 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-01-09 16:36:57,120 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 210 flow [2025-01-09 16:36:57,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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:36:57,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:57,120 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:36:57,129 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:36:57,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:57,321 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 2 more)] === [2025-01-09 16:36:57,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash -317495979, now seen corresponding path program 1 times [2025-01-09 16:36:57,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:57,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160574130] [2025-01-09 16:36:57,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:57,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:57,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:36:57,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:57,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:57,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160574130] [2025-01-09 16:36:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160574130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:57,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:57,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:36:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646979928] [2025-01-09 16:36:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:57,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:36:57,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:57,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:36:57,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:36:57,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-09 16:36:57,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:36:57,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:57,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-09 16:36:57,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:57,588 INFO L124 PetriNetUnfolderBase]: 1874/2490 cut-off events. [2025-01-09 16:36:57,588 INFO L125 PetriNetUnfolderBase]: For 4485/4485 co-relation queries the response was YES. [2025-01-09 16:36:57,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9111 conditions, 2490 events. 1874/2490 cut-off events. For 4485/4485 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9567 event pairs, 70 based on Foata normal form. 33/2499 useless extension candidates. Maximal degree in co-relation 4624. Up to 1030 conditions per place. [2025-01-09 16:36:57,600 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 81 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2025-01-09 16:36:57,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 96 transitions, 653 flow [2025-01-09 16:36:57,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:36:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:36:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-01-09 16:36:57,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-01-09 16:36:57,601 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 210 flow. Second operand 5 states and 106 transitions. [2025-01-09 16:36:57,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 96 transitions, 653 flow [2025-01-09 16:36:57,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 96 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:36:57,607 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 273 flow [2025-01-09 16:36:57,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2025-01-09 16:36:57,608 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2025-01-09 16:36:57,608 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 273 flow [2025-01-09 16:36:57,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:36:57,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:57,608 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:36:57,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:36:57,608 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 2 more)] === [2025-01-09 16:36:57,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:57,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2008158959, now seen corresponding path program 2 times [2025-01-09 16:36:57,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:57,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74767188] [2025-01-09 16:36:57,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:36:57,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:57,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 16:36:57,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:57,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:36:57,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:57,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:57,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74767188] [2025-01-09 16:36:57,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74767188] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:57,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728939810] [2025-01-09 16:36:57,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:36:57,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:57,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:57,734 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:36:57,736 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:36:57,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 16:36:57,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:57,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:36:57,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:57,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:36:57,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:36:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:57,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:36:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:58,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728939810] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:36:58,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:36:58,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-09 16:36:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113641669] [2025-01-09 16:36:58,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:36:58,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:36:58,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:58,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:36:58,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:36:58,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-09 16:36:58,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:36:58,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:58,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-09 16:36:58,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:58,251 INFO L124 PetriNetUnfolderBase]: 1812/2440 cut-off events. [2025-01-09 16:36:58,251 INFO L125 PetriNetUnfolderBase]: For 5116/5116 co-relation queries the response was YES. [2025-01-09 16:36:58,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9536 conditions, 2440 events. 1812/2440 cut-off events. For 5116/5116 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9807 event pairs, 257 based on Foata normal form. 62/2478 useless extension candidates. Maximal degree in co-relation 4687. Up to 1433 conditions per place. [2025-01-09 16:36:58,264 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 79 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2025-01-09 16:36:58,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 94 transitions, 684 flow [2025-01-09 16:36:58,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:36:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:36:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2025-01-09 16:36:58,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64375 [2025-01-09 16:36:58,266 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 273 flow. Second operand 5 states and 103 transitions. [2025-01-09 16:36:58,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 94 transitions, 684 flow [2025-01-09 16:36:58,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 94 transitions, 669 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-01-09 16:36:58,274 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 312 flow [2025-01-09 16:36:58,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-01-09 16:36:58,275 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2025-01-09 16:36:58,276 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 312 flow [2025-01-09 16:36:58,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:36:58,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:58,276 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:36:58,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:36:58,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:58,480 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 2 more)] === [2025-01-09 16:36:58,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:58,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1567692858, now seen corresponding path program 2 times [2025-01-09 16:36:58,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:58,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185787112] [2025-01-09 16:36:58,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:36:58,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:58,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 16:36:58,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:58,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:36:58,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:58,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:58,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185787112] [2025-01-09 16:36:58,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185787112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:58,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:58,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:36:58,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000491048] [2025-01-09 16:36:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:58,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:36:58,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:58,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:36:58,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:36:58,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-09 16:36:58,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:36:58,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:58,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-09 16:36:58,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:58,767 INFO L124 PetriNetUnfolderBase]: 1625/2171 cut-off events. [2025-01-09 16:36:58,768 INFO L125 PetriNetUnfolderBase]: For 5130/5130 co-relation queries the response was YES. [2025-01-09 16:36:58,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9016 conditions, 2171 events. 1625/2171 cut-off events. For 5130/5130 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8148 event pairs, 74 based on Foata normal form. 31/2178 useless extension candidates. Maximal degree in co-relation 7765. Up to 896 conditions per place. [2025-01-09 16:36:58,778 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 81 selfloop transitions, 9 changer transitions 2/97 dead transitions. [2025-01-09 16:36:58,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 97 transitions, 711 flow [2025-01-09 16:36:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:36:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:36:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-01-09 16:36:58,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-01-09 16:36:58,779 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 312 flow. Second operand 5 states and 106 transitions. [2025-01-09 16:36:58,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 97 transitions, 711 flow [2025-01-09 16:36:58,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 691 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-09 16:36:58,785 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 307 flow [2025-01-09 16:36:58,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-01-09 16:36:58,786 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2025-01-09 16:36:58,786 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 307 flow [2025-01-09 16:36:58,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:36:58,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:58,786 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:36:58,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:36:58,786 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 2 more)] === [2025-01-09 16:36:58,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:58,787 INFO L85 PathProgramCache]: Analyzing trace with hash -720002767, now seen corresponding path program 1 times [2025-01-09 16:36:58,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:58,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722926262] [2025-01-09 16:36:58,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:58,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:58,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:36:58,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:58,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:58,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:58,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:58,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722926262] [2025-01-09 16:36:58,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722926262] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:58,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131989936] [2025-01-09 16:36:58,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:58,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:58,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:58,832 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:36:58,833 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:36:58,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:36:58,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:58,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:58,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:58,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:36:58,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:36:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:58,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:36:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:58,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131989936] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:36:58,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:36:58,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-09 16:36:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577303594] [2025-01-09 16:36:58,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:36:58,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:36:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:58,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:36:58,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:36:58,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-09 16:36:58,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:36:58,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:58,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-09 16:36:58,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:59,154 INFO L124 PetriNetUnfolderBase]: 1745/2388 cut-off events. [2025-01-09 16:36:59,154 INFO L125 PetriNetUnfolderBase]: For 6835/6835 co-relation queries the response was YES. [2025-01-09 16:36:59,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10169 conditions, 2388 events. 1745/2388 cut-off events. For 6835/6835 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10199 event pairs, 349 based on Foata normal form. 80/2458 useless extension candidates. Maximal degree in co-relation 8649. Up to 1174 conditions per place. [2025-01-09 16:36:59,165 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 115 selfloop transitions, 10 changer transitions 0/130 dead transitions. [2025-01-09 16:36:59,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 130 transitions, 1055 flow [2025-01-09 16:36:59,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:36:59,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:36:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-01-09 16:36:59,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7375 [2025-01-09 16:36:59,166 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 307 flow. Second operand 5 states and 118 transitions. [2025-01-09 16:36:59,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 130 transitions, 1055 flow [2025-01-09 16:36:59,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 130 transitions, 1022 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-01-09 16:36:59,172 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 352 flow [2025-01-09 16:36:59,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2025-01-09 16:36:59,173 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2025-01-09 16:36:59,173 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 352 flow [2025-01-09 16:36:59,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:36:59,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:59,173 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:36:59,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:36:59,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:59,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:36:59,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:59,380 INFO L85 PathProgramCache]: Analyzing trace with hash 522712757, now seen corresponding path program 2 times [2025-01-09 16:36:59,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:59,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496557387] [2025-01-09 16:36:59,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:36:59,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:59,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 16:36:59,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:59,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:36:59,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:59,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:59,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496557387] [2025-01-09 16:36:59,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496557387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:59,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:59,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:36:59,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706905861] [2025-01-09 16:36:59,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:59,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:36:59,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:59,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:36:59,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:36:59,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-09 16:36:59,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:36:59,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:59,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-09 16:36:59,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:59,607 INFO L124 PetriNetUnfolderBase]: 1515/2042 cut-off events. [2025-01-09 16:36:59,607 INFO L125 PetriNetUnfolderBase]: For 6807/6807 co-relation queries the response was YES. [2025-01-09 16:36:59,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9439 conditions, 2042 events. 1515/2042 cut-off events. For 6807/6807 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8073 event pairs, 89 based on Foata normal form. 34/2072 useless extension candidates. Maximal degree in co-relation 8378. Up to 864 conditions per place. [2025-01-09 16:36:59,615 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 108 selfloop transitions, 9 changer transitions 4/126 dead transitions. [2025-01-09 16:36:59,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 126 transitions, 1031 flow [2025-01-09 16:36:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:36:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:36:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-01-09 16:36:59,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7125 [2025-01-09 16:36:59,616 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 352 flow. Second operand 5 states and 114 transitions. [2025-01-09 16:36:59,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 126 transitions, 1031 flow [2025-01-09 16:36:59,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 126 transitions, 1022 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:36:59,622 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 356 flow [2025-01-09 16:36:59,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2025-01-09 16:36:59,623 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2025-01-09 16:36:59,623 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 356 flow [2025-01-09 16:36:59,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:36:59,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:59,623 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:36:59,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:36:59,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:36:59,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:59,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1420150183, now seen corresponding path program 2 times [2025-01-09 16:36:59,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:59,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804315543] [2025-01-09 16:36:59,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:36:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:59,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 16:36:59,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:59,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:36:59,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:59,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:59,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804315543] [2025-01-09 16:36:59,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804315543] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:59,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231183993] [2025-01-09 16:36:59,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:36:59,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:59,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:59,685 INFO L229 MonitoredProcess]: Starting monitored process 5 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:36:59,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:36:59,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 16:36:59,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:59,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:36:59,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:59,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:36:59,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:36:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:59,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:36:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:59,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231183993] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:36:59,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:36:59,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-01-09 16:36:59,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860285130] [2025-01-09 16:36:59,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:36:59,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:36:59,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:59,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:36:59,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:36:59,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-09 16:36:59,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 356 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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:36:59,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:59,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-09 16:36:59,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:00,090 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2025-01-09 16:37:00,090 INFO L125 PetriNetUnfolderBase]: For 6884/6884 co-relation queries the response was YES. [2025-01-09 16:37:00,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9472 conditions, 1987 events. 1447/1987 cut-off events. For 6884/6884 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8192 event pairs, 375 based on Foata normal form. 68/2045 useless extension candidates. Maximal degree in co-relation 8410. Up to 1150 conditions per place. [2025-01-09 16:37:00,097 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2025-01-09 16:37:00,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 124 transitions, 1051 flow [2025-01-09 16:37:00,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:37:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:37:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-01-09 16:37:00,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.69375 [2025-01-09 16:37:00,098 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 356 flow. Second operand 5 states and 111 transitions. [2025-01-09 16:37:00,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 124 transitions, 1051 flow [2025-01-09 16:37:00,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 1044 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:37:00,103 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 403 flow [2025-01-09 16:37:00,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-01-09 16:37:00,103 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2025-01-09 16:37:00,104 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 403 flow [2025-01-09 16:37:00,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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:37:00,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:00,104 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:37:00,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:37:00,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 16:37:00,304 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:37:00,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:00,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1844101113, now seen corresponding path program 1 times [2025-01-09 16:37:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:00,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497147850] [2025-01-09 16:37:00,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:00,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:37:00,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:37:00,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:00,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:37:00,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:00,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497147850] [2025-01-09 16:37:00,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497147850] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:37:00,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133253063] [2025-01-09 16:37:00,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:00,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:37:00,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:37:00,614 INFO L229 MonitoredProcess]: Starting monitored process 6 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:37:00,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:37:00,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:37:00,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:37:00,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:00,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:00,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:37:00,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:37:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:37:54,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:38:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:38:09,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133253063] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:38:09,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:38:09,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-01-09 16:38:09,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772127479] [2025-01-09 16:38:09,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:38:09,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:38:09,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:38:09,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:38:09,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=136, Unknown=3, NotChecked=0, Total=182 [2025-01-09 16:38:09,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-01-09 16:38:09,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 403 flow. Second operand has 14 states, 14 states have (on average 12.928571428571429) internal successors, (181), 14 states have internal predecessors, (181), 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:38:09,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:38:09,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-01-09 16:38:09,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:38:23,125 WARN L286 SmtUtils]: Spent 9.65s on a formula simplification. DAG size of input: 58 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 16:38:26,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 16:38:33,007 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 59 DAG size of output: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 16:38:35,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []