./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/unwind1-100.i --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/pthread-theta/unwind1-100.i -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 d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:51:49,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:51:49,977 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:51:49,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:51:49,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:51:50,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:51:50,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:51:50,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:51:50,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:51:50,019 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:51:50,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:51:50,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:51:50,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:51:50,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:51:50,019 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:51:50,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:51:50,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:51:50,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:51:50,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:51:50,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:51:50,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:51:50,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:51:50,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:51:50,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:51:50,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:51:50,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:51:50,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:51:50,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:51:50,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:51:50,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:51:50,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:51:50,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:51:50,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:51:50,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:51:50,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:51:50,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:51:50,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:51:50,023 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 -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2025-01-09 16:51:50,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:51:50,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:51:50,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:51:50,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:51:50,318 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:51:50,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-01-09 16:51:51,577 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18978c8d7/4fbb99a7ceab4748b57e8d899686fd69/FLAGe293225df [2025-01-09 16:51:51,859 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:51:51,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind1-100.i [2025-01-09 16:51:51,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18978c8d7/4fbb99a7ceab4748b57e8d899686fd69/FLAGe293225df [2025-01-09 16:51:51,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18978c8d7/4fbb99a7ceab4748b57e8d899686fd69 [2025-01-09 16:51:51,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:51:51,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:51:51,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:51:51,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:51:51,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:51:51,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:51:51" (1/1) ... [2025-01-09 16:51:51,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f39d2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:51, skipping insertion in model container [2025-01-09 16:51:51,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:51:51" (1/1) ... [2025-01-09 16:51:51,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:51:52,244 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/pthread-theta/unwind1-100.i[33026,33039] [2025-01-09 16:51:52,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:51:52,275 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:51:52,315 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/pthread-theta/unwind1-100.i[33026,33039] [2025-01-09 16:51:52,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:51:52,358 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:51:52,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52 WrapperNode [2025-01-09 16:51:52,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:51:52,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:51:52,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:51:52,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:51:52,366 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:51:52" (1/1) ... [2025-01-09 16:51:52,382 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:51:52" (1/1) ... [2025-01-09 16:51:52,401 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-01-09 16:51:52,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:51:52,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:51:52,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:51:52,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:51:52,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (1/1) ... [2025-01-09 16:51:52,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (1/1) ... [2025-01-09 16:51:52,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (1/1) ... [2025-01-09 16:51:52,432 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:51:52,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (1/1) ... [2025-01-09 16:51:52,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (1/1) ... [2025-01-09 16:51:52,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (1/1) ... [2025-01-09 16:51:52,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (1/1) ... [2025-01-09 16:51:52,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (1/1) ... [2025-01-09 16:51:52,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (1/1) ... [2025-01-09 16:51:52,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (1/1) ... [2025-01-09 16:51:52,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:51:52,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:51:52,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:51:52,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:51:52,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (1/1) ... [2025-01-09 16:51:52,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:51:52,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:51:52,486 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:51:52,489 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:51:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:51:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-01-09 16:51:52,510 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-01-09 16:51:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-01-09 16:51:52,510 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-01-09 16:51:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:51:52,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:51:52,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:51:52,511 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:51:52,643 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:51:52,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:51:52,780 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:51:52,780 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:51:52,853 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:51:52,853 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:51:52,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:51:52 BoogieIcfgContainer [2025-01-09 16:51:52,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:51:52,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:51:52,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:51:52,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:51:52,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:51:51" (1/3) ... [2025-01-09 16:51:52,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16688a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:51:52, skipping insertion in model container [2025-01-09 16:51:52,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:51:52" (2/3) ... [2025-01-09 16:51:52,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16688a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:51:52, skipping insertion in model container [2025-01-09 16:51:52,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:51:52" (3/3) ... [2025-01-09 16:51:52,866 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-01-09 16:51:52,879 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:51:52,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 22 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:51:52,882 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:51:52,926 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:51:52,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 62 flow [2025-01-09 16:51:52,994 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-01-09 16:51:52,996 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:51:52,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 3/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-01-09 16:51:52,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 24 transitions, 62 flow [2025-01-09 16:51:53,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 49 flow [2025-01-09 16:51:53,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:51:53,026 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;@724013e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:51:53,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:51:53,038 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:51:53,038 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-01-09 16:51:53,038 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:51:53,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:53,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:53,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:51:53,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:53,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1807383310, now seen corresponding path program 1 times [2025-01-09 16:51:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:53,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783285053] [2025-01-09 16:51:53,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:53,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:51:53,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:51:53,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:53,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:53,440 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:51:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:53,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783285053] [2025-01-09 16:51:53,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783285053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:53,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:53,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:51:53,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550113223] [2025-01-09 16:51:53,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:53,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:51:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:53,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:51:53,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:51:53,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:51:53,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 49 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:53,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:53,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:51:53,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:53,711 INFO L124 PetriNetUnfolderBase]: 152/286 cut-off events. [2025-01-09 16:51:53,712 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-01-09 16:51:53,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 286 events. 152/286 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 68 based on Foata normal form. 11/241 useless extension candidates. Maximal degree in co-relation 522. Up to 145 conditions per place. [2025-01-09 16:51:53,716 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 25 selfloop transitions, 7 changer transitions 6/41 dead transitions. [2025-01-09 16:51:53,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 176 flow [2025-01-09 16:51:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:51:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:51:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-01-09 16:51:53,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2025-01-09 16:51:53,732 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 49 flow. Second operand 6 states and 70 transitions. [2025-01-09 16:51:53,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 176 flow [2025-01-09 16:51:53,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 41 transitions, 165 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:51:53,743 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 83 flow [2025-01-09 16:51:53,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=83, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2025-01-09 16:51:53,749 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2025-01-09 16:51:53,750 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 83 flow [2025-01-09 16:51:53,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:53,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:53,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:53,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:51:53,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:51:53,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash -194338401, now seen corresponding path program 1 times [2025-01-09 16:51:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:53,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023113634] [2025-01-09 16:51:53,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:53,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:51:53,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:51:53,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:53,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:53,898 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:51:53,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:53,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023113634] [2025-01-09 16:51:53,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023113634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:51:53,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:51:53,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:51:53,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532675305] [2025-01-09 16:51:53,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:51:53,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:51:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:53,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:51:53,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:51:53,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:51:53,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:53,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:53,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:51:53,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:54,004 INFO L124 PetriNetUnfolderBase]: 106/228 cut-off events. [2025-01-09 16:51:54,005 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-01-09 16:51:54,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 228 events. 106/228 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 864 event pairs, 27 based on Foata normal form. 13/226 useless extension candidates. Maximal degree in co-relation 475. Up to 85 conditions per place. [2025-01-09 16:51:54,007 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 16 selfloop transitions, 3 changer transitions 18/40 dead transitions. [2025-01-09 16:51:54,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 212 flow [2025-01-09 16:51:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:51:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:51:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2025-01-09 16:51:54,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-09 16:51:54,009 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 83 flow. Second operand 5 states and 60 transitions. [2025-01-09 16:51:54,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 212 flow [2025-01-09 16:51:54,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:51:54,012 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 76 flow [2025-01-09 16:51:54,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2025-01-09 16:51:54,013 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2025-01-09 16:51:54,013 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 76 flow [2025-01-09 16:51:54,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:51:54,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:54,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:54,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:51:54,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:51:54,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1247871625, now seen corresponding path program 1 times [2025-01-09 16:51:54,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:54,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13194506] [2025-01-09 16:51:54,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:54,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:51:54,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:51:54,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:54,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:54,158 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:51:54,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:54,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13194506] [2025-01-09 16:51:54,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13194506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:51:54,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525170885] [2025-01-09 16:51:54,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:54,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:54,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:51:54,162 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:51:54,164 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:51:54,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:51:54,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:51:54,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:54,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:54,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:51:54,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:51:54,303 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:51:54,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:51:54,383 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:51:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525170885] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:51:54,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:51:54,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-09 16:51:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34651416] [2025-01-09 16:51:54,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:51:54,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:51:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:54,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:51:54,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:51:54,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-01-09 16:51:54,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 19 transitions, 76 flow. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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:51:54,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:54,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-01-09 16:51:54,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:54,656 INFO L124 PetriNetUnfolderBase]: 64/135 cut-off events. [2025-01-09 16:51:54,656 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-09 16:51:54,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 135 events. 64/135 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 319 event pairs, 18 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 341. Up to 54 conditions per place. [2025-01-09 16:51:54,658 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 27 selfloop transitions, 8 changer transitions 4/40 dead transitions. [2025-01-09 16:51:54,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 209 flow [2025-01-09 16:51:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:51:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:51:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2025-01-09 16:51:54,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2025-01-09 16:51:54,663 INFO L175 Difference]: Start difference. First operand has 35 places, 19 transitions, 76 flow. Second operand 9 states and 69 transitions. [2025-01-09 16:51:54,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 209 flow [2025-01-09 16:51:54,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 187 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-01-09 16:51:54,668 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 93 flow [2025-01-09 16:51:54,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=93, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2025-01-09 16:51:54,668 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2025-01-09 16:51:54,668 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 93 flow [2025-01-09 16:51:54,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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:51:54,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:54,669 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:54,682 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:51:54,876 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:51:54,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:51:54,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:54,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1862909274, now seen corresponding path program 2 times [2025-01-09 16:51:54,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:54,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155240618] [2025-01-09 16:51:54,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:51:54,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:54,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-09 16:51:54,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:51:54,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:51:54,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:55,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:55,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155240618] [2025-01-09 16:51:55,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155240618] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:51:55,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884420223] [2025-01-09 16:51:55,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:51:55,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:55,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:51:55,075 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:51:55,077 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:51:55,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-09 16:51:55,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:51:55,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:51:55,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:55,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:51:55,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:51:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:55,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:51:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:55,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884420223] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:51:55,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:51:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-01-09 16:51:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670576] [2025-01-09 16:51:55,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:51:55,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 16:51:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:55,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 16:51:55,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=268, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:51:55,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-01-09 16:51:55,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 93 flow. Second operand has 21 states, 21 states have (on average 6.523809523809524) internal successors, (137), 21 states have internal predecessors, (137), 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:51:55,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:55,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-01-09 16:51:55,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:55,817 INFO L124 PetriNetUnfolderBase]: 115/240 cut-off events. [2025-01-09 16:51:55,817 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2025-01-09 16:51:55,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 240 events. 115/240 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 694 event pairs, 27 based on Foata normal form. 30/264 useless extension candidates. Maximal degree in co-relation 698. Up to 91 conditions per place. [2025-01-09 16:51:55,820 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 42 selfloop transitions, 12 changer transitions 24/81 dead transitions. [2025-01-09 16:51:55,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 457 flow [2025-01-09 16:51:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:51:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 16:51:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 179 transitions. [2025-01-09 16:51:55,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3925438596491228 [2025-01-09 16:51:55,824 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 93 flow. Second operand 19 states and 179 transitions. [2025-01-09 16:51:55,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 457 flow [2025-01-09 16:51:55,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 81 transitions, 434 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-09 16:51:55,829 INFO L231 Difference]: Finished difference. Result has 58 places, 27 transitions, 168 flow [2025-01-09 16:51:55,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=168, PETRI_PLACES=58, PETRI_TRANSITIONS=27} [2025-01-09 16:51:55,830 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 34 predicate places. [2025-01-09 16:51:55,831 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 27 transitions, 168 flow [2025-01-09 16:51:55,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.523809523809524) internal successors, (137), 21 states have internal predecessors, (137), 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:51:55,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:55,831 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:55,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:51:56,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:56,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:51:56,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash -857745350, now seen corresponding path program 3 times [2025-01-09 16:51:56,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:56,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433658437] [2025-01-09 16:51:56,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:51:56,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:56,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-01-09 16:51:56,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 21 statements. [2025-01-09 16:51:56,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:51:56,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:51:56,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:56,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433658437] [2025-01-09 16:51:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433658437] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:51:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468130394] [2025-01-09 16:51:56,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:51:56,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:56,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:51:56,145 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:51:56,147 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:51:56,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-01-09 16:51:56,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 21 statements. [2025-01-09 16:51:56,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:51:56,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:56,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 16:51:56,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:51:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:51:56,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:51:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 16:51:56,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468130394] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:51:56,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:51:56,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-01-09 16:51:56,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371182520] [2025-01-09 16:51:56,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:51:56,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:51:56,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:56,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:51:56,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:51:56,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-01-09 16:51:56,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 27 transitions, 168 flow. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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:51:56,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:56,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-01-09 16:51:56,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:56,402 INFO L124 PetriNetUnfolderBase]: 156/321 cut-off events. [2025-01-09 16:51:56,402 INFO L125 PetriNetUnfolderBase]: For 539/539 co-relation queries the response was YES. [2025-01-09 16:51:56,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 321 events. 156/321 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1022 event pairs, 54 based on Foata normal form. 5/322 useless extension candidates. Maximal degree in co-relation 1108. Up to 151 conditions per place. [2025-01-09 16:51:56,407 INFO L140 encePairwiseOnDemand]: 18/24 looper letters, 25 selfloop transitions, 2 changer transitions 26/54 dead transitions. [2025-01-09 16:51:56,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 428 flow [2025-01-09 16:51:56,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:51:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:51:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2025-01-09 16:51:56,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2025-01-09 16:51:56,408 INFO L175 Difference]: Start difference. First operand has 58 places, 27 transitions, 168 flow. Second operand 6 states and 53 transitions. [2025-01-09 16:51:56,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 428 flow [2025-01-09 16:51:56,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 327 flow, removed 42 selfloop flow, removed 11 redundant places. [2025-01-09 16:51:56,417 INFO L231 Difference]: Finished difference. Result has 50 places, 25 transitions, 120 flow [2025-01-09 16:51:56,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=50, PETRI_TRANSITIONS=25} [2025-01-09 16:51:56,418 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 26 predicate places. [2025-01-09 16:51:56,418 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 25 transitions, 120 flow [2025-01-09 16:51:56,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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:51:56,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:56,418 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:56,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:51:56,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:56,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:51:56,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash 139272282, now seen corresponding path program 1 times [2025-01-09 16:51:56,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:56,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133058083] [2025-01-09 16:51:56,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:56,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:56,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:51:56,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:51:56,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:56,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:56,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133058083] [2025-01-09 16:51:56,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133058083] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:51:56,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033775289] [2025-01-09 16:51:56,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:51:56,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:56,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:51:56,905 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:51:56,907 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:51:56,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:51:56,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:51:56,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:51:56,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:56,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 16:51:56,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:51:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:57,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:51:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:57,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033775289] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:51:57,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:51:57,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-01-09 16:51:57,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068299415] [2025-01-09 16:51:57,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:51:57,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 16:51:57,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:51:57,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 16:51:57,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 16:51:57,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-01-09 16:51:57,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 25 transitions, 120 flow. Second operand has 40 states, 40 states have (on average 4.325) internal successors, (173), 40 states have internal predecessors, (173), 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:51:57,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:51:57,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-01-09 16:51:57,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:51:58,433 INFO L124 PetriNetUnfolderBase]: 142/294 cut-off events. [2025-01-09 16:51:58,433 INFO L125 PetriNetUnfolderBase]: For 3084/3084 co-relation queries the response was YES. [2025-01-09 16:51:58,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 294 events. 142/294 cut-off events. For 3084/3084 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 664 event pairs, 15 based on Foata normal form. 60/354 useless extension candidates. Maximal degree in co-relation 903. Up to 76 conditions per place. [2025-01-09 16:51:58,436 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 80 selfloop transitions, 25 changer transitions 0/106 dead transitions. [2025-01-09 16:51:58,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 588 flow [2025-01-09 16:51:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 16:51:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-09 16:51:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 195 transitions. [2025-01-09 16:51:58,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-01-09 16:51:58,440 INFO L175 Difference]: Start difference. First operand has 50 places, 25 transitions, 120 flow. Second operand 26 states and 195 transitions. [2025-01-09 16:51:58,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 588 flow [2025-01-09 16:51:58,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 574 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-09 16:51:58,447 INFO L231 Difference]: Finished difference. Result has 77 places, 37 transitions, 302 flow [2025-01-09 16:51:58,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=302, PETRI_PLACES=77, PETRI_TRANSITIONS=37} [2025-01-09 16:51:58,447 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 53 predicate places. [2025-01-09 16:51:58,447 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 37 transitions, 302 flow [2025-01-09 16:51:58,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.325) internal successors, (173), 40 states have internal predecessors, (173), 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:51:58,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:51:58,448 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:51:58,456 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:51:58,648 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,SelfDestructingSolverStorable5 [2025-01-09 16:51:58,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:51:58,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:51:58,649 INFO L85 PathProgramCache]: Analyzing trace with hash 368389658, now seen corresponding path program 2 times [2025-01-09 16:51:58,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:51:58,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810837300] [2025-01-09 16:51:58,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:51:58,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:51:58,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 16:51:58,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:51:58,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:51:58,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:51:59,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:51:59,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810837300] [2025-01-09 16:51:59,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810837300] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:51:59,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692037911] [2025-01-09 16:51:59,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:51:59,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:51:59,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:51:59,232 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:51:59,233 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:51:59,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 16:51:59,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 16:51:59,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:51:59,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:51:59,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 16:51:59,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:52:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:00,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:52:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:01,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692037911] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:52:01,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:52:01,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2025-01-09 16:52:01,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99725506] [2025-01-09 16:52:01,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:52:01,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-01-09 16:52:01,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:01,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-01-09 16:52:01,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=4259, Unknown=0, NotChecked=0, Total=5700 [2025-01-09 16:52:01,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-01-09 16:52:01,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 37 transitions, 302 flow. Second operand has 76 states, 76 states have (on average 4.171052631578948) internal successors, (317), 76 states have internal predecessors, (317), 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:52:01,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:01,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-01-09 16:52:01,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:03,260 INFO L124 PetriNetUnfolderBase]: 262/534 cut-off events. [2025-01-09 16:52:03,260 INFO L125 PetriNetUnfolderBase]: For 26319/26319 co-relation queries the response was YES. [2025-01-09 16:52:03,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 534 events. 262/534 cut-off events. For 26319/26319 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1224 event pairs, 15 based on Foata normal form. 120/654 useless extension candidates. Maximal degree in co-relation 2046. Up to 196 conditions per place. [2025-01-09 16:52:03,273 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 152 selfloop transitions, 49 changer transitions 0/202 dead transitions. [2025-01-09 16:52:03,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 202 transitions, 1274 flow [2025-01-09 16:52:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-09 16:52:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-01-09 16:52:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 375 transitions. [2025-01-09 16:52:03,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-01-09 16:52:03,276 INFO L175 Difference]: Start difference. First operand has 77 places, 37 transitions, 302 flow. Second operand 50 states and 375 transitions. [2025-01-09 16:52:03,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 202 transitions, 1274 flow [2025-01-09 16:52:03,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 202 transitions, 1049 flow, removed 98 selfloop flow, removed 14 redundant places. [2025-01-09 16:52:03,297 INFO L231 Difference]: Finished difference. Result has 136 places, 61 transitions, 513 flow [2025-01-09 16:52:03,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=513, PETRI_PLACES=136, PETRI_TRANSITIONS=61} [2025-01-09 16:52:03,299 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 112 predicate places. [2025-01-09 16:52:03,300 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 61 transitions, 513 flow [2025-01-09 16:52:03,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.171052631578948) internal successors, (317), 76 states have internal predecessors, (317), 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:52:03,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:03,301 INFO L206 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:03,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:52:03,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:03,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:52:03,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1627297382, now seen corresponding path program 3 times [2025-01-09 16:52:03,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:03,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597443042] [2025-01-09 16:52:03,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:52:03,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:03,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 24 equivalence classes. [2025-01-09 16:52:03,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 16:52:03,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-01-09 16:52:03,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:04,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:04,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597443042] [2025-01-09 16:52:04,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597443042] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:52:04,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327950751] [2025-01-09 16:52:04,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:52:04,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:04,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:52:04,958 INFO L229 MonitoredProcess]: Starting monitored process 7 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:52:04,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:52:04,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 24 equivalence classes. [2025-01-09 16:52:05,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 16:52:05,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-01-09 16:52:05,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:05,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 16:52:05,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:52:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:06,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:52:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:10,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327950751] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:52:10,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:52:10,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2025-01-09 16:52:10,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438609897] [2025-01-09 16:52:10,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:52:10,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2025-01-09 16:52:10,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:10,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2025-01-09 16:52:10,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5749, Invalid=16007, Unknown=0, NotChecked=0, Total=21756 [2025-01-09 16:52:10,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-01-09 16:52:10,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 61 transitions, 513 flow. Second operand has 148 states, 148 states have (on average 4.087837837837838) internal successors, (605), 148 states have internal predecessors, (605), 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:52:10,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:10,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-01-09 16:52:10,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:17,558 INFO L124 PetriNetUnfolderBase]: 502/1014 cut-off events. [2025-01-09 16:52:17,558 INFO L125 PetriNetUnfolderBase]: For 242560/242560 co-relation queries the response was YES. [2025-01-09 16:52:17,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1014 events. 502/1014 cut-off events. For 242560/242560 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2344 event pairs, 15 based on Foata normal form. 240/1254 useless extension candidates. Maximal degree in co-relation 3656. Up to 376 conditions per place. [2025-01-09 16:52:17,571 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 296 selfloop transitions, 97 changer transitions 0/394 dead transitions. [2025-01-09 16:52:17,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 394 transitions, 2349 flow [2025-01-09 16:52:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-01-09 16:52:17,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2025-01-09 16:52:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 735 transitions. [2025-01-09 16:52:17,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-01-09 16:52:17,577 INFO L175 Difference]: Start difference. First operand has 136 places, 61 transitions, 513 flow. Second operand 98 states and 735 transitions. [2025-01-09 16:52:17,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 394 transitions, 2349 flow [2025-01-09 16:52:17,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 394 transitions, 2057 flow, removed 121 selfloop flow, removed 25 redundant places. [2025-01-09 16:52:17,653 INFO L231 Difference]: Finished difference. Result has 256 places, 109 transitions, 993 flow [2025-01-09 16:52:17,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=993, PETRI_PLACES=256, PETRI_TRANSITIONS=109} [2025-01-09 16:52:17,654 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 232 predicate places. [2025-01-09 16:52:17,654 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 109 transitions, 993 flow [2025-01-09 16:52:17,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 4.087837837837838) internal successors, (605), 148 states have internal predecessors, (605), 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:52:17,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:17,655 INFO L206 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:17,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 16:52:17,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 16:52:17,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:52:17,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash 977952922, now seen corresponding path program 4 times [2025-01-09 16:52:17,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:17,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104540391] [2025-01-09 16:52:17,857 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:52:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:17,873 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 105 statements into 2 equivalence classes. [2025-01-09 16:52:17,930 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:52:17,931 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:52:17,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:22,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:52:22,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104540391] [2025-01-09 16:52:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104540391] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:52:22,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299441901] [2025-01-09 16:52:22,752 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:52:22,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:22,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:52:22,755 INFO L229 MonitoredProcess]: Starting monitored process 8 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:52:22,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:52:22,805 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 105 statements into 2 equivalence classes. [2025-01-09 16:52:22,855 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:52:22,855 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:52:22,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:52:22,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-01-09 16:52:22,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:52:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:29,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:52:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:52:40,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299441901] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:52:40,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:52:40,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 291 [2025-01-09 16:52:40,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665665535] [2025-01-09 16:52:40,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:52:40,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 292 states [2025-01-09 16:52:40,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:52:40,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 292 interpolants. [2025-01-09 16:52:40,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19087, Invalid=65885, Unknown=0, NotChecked=0, Total=84972 [2025-01-09 16:52:40,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2025-01-09 16:52:40,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 109 transitions, 993 flow. Second operand has 292 states, 292 states have (on average 4.044520547945205) internal successors, (1181), 292 states have internal predecessors, (1181), 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:52:40,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:52:40,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2025-01-09 16:52:40,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:52:51,278 INFO L124 PetriNetUnfolderBase]: 537/1084 cut-off events. [2025-01-09 16:52:51,279 INFO L125 PetriNetUnfolderBase]: For 170993/170993 co-relation queries the response was YES. [2025-01-09 16:52:51,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 1084 events. 537/1084 cut-off events. For 170993/170993 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2509 event pairs, 15 based on Foata normal form. 35/1119 useless extension candidates. Maximal degree in co-relation 4141. Up to 291 conditions per place. [2025-01-09 16:52:51,291 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 317 selfloop transitions, 104 changer transitions 0/422 dead transitions. [2025-01-09 16:52:51,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 422 transitions, 2606 flow [2025-01-09 16:52:51,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-01-09 16:52:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2025-01-09 16:52:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 743 transitions. [2025-01-09 16:52:51,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29484126984126985 [2025-01-09 16:52:51,299 INFO L175 Difference]: Start difference. First operand has 256 places, 109 transitions, 993 flow. Second operand 105 states and 743 transitions. [2025-01-09 16:52:51,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 422 transitions, 2606 flow [2025-01-09 16:52:51,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 422 transitions, 2204 flow, removed 152 selfloop flow, removed 49 redundant places. [2025-01-09 16:52:51,471 INFO L231 Difference]: Finished difference. Result has 318 places, 116 transitions, 885 flow [2025-01-09 16:52:51,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=885, PETRI_PLACES=318, PETRI_TRANSITIONS=116} [2025-01-09 16:52:51,472 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 294 predicate places. [2025-01-09 16:52:51,472 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 116 transitions, 885 flow [2025-01-09 16:52:51,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 292 states, 292 states have (on average 4.044520547945205) internal successors, (1181), 292 states have internal predecessors, (1181), 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:52:51,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:52:51,473 INFO L206 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:52:51,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 16:52:51,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:52:51,674 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-01-09 16:52:51,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:52:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash 867691543, now seen corresponding path program 5 times [2025-01-09 16:52:51,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:52:51,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125469041] [2025-01-09 16:52:51,676 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:52:51,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:52:51,684 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 52 equivalence classes. [2025-01-09 16:52:51,782 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:52:51,782 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2025-01-09 16:52:51,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:52:51,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:52:51,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:52:51,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:52:51,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:52:51,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:52:51,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:52:51,908 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:52:51,909 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-01-09 16:52:51,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-09 16:52:51,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-09 16:52:51,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:52:51,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:52:51,911 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1] [2025-01-09 16:52:52,055 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:52:52,055 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:52:52,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:52:52 BasicIcfg [2025-01-09 16:52:52,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:52:52,062 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:52:52,064 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:52:52,064 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:52:52,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:51:52" (3/4) ... [2025-01-09 16:52:52,065 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:52:52,150 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 109. [2025-01-09 16:52:52,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:52:52,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:52:52,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:52:52,251 INFO L158 Benchmark]: Toolchain (without parser) took 60361.94ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 112.4MB in the beginning and 189.0MB in the end (delta: -76.5MB). Peak memory consumption was 166.5MB. Max. memory is 16.1GB. [2025-01-09 16:52:52,252 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:52:52,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.67ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 92.4MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:52:52,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.86ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:52:52,252 INFO L158 Benchmark]: Boogie Preprocessor took 49.30ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:52:52,252 INFO L158 Benchmark]: RCFGBuilder took 401.52ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 70.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:52:52,252 INFO L158 Benchmark]: TraceAbstraction took 59206.49ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 70.4MB in the beginning and 210.4MB in the end (delta: -140.0MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2025-01-09 16:52:52,253 INFO L158 Benchmark]: Witness Printer took 188.50ms. Allocated memory is still 385.9MB. Free memory was 210.4MB in the beginning and 189.0MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:52:52,254 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.67ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 92.4MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.86ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 90.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.30ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 401.52ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 70.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 59206.49ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 70.4MB in the beginning and 210.4MB in the end (delta: -140.0MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. * Witness Printer took 188.50ms. Allocated memory is still 385.9MB. Free memory was 210.4MB in the beginning and 189.0MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=100, limit=0, t1=0] [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0, t1=0, t2=1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression VAL [\old(arg)={0:0}, \old(expression)=0, _N=100, arg={0:0}, expression=0, limit=101] [L753] 2 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, _N=100, arg={0:0}, expression=0, limit=101] - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 37 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 59.0s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6931 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6916 mSDsluCounter, 1223 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1213 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3687 IncrementalHoareTripleChecker+Invalid, 3706 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 10 mSDtfsCounter, 3687 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1020 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 879 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50542 ImplicationChecksByTransitivity, 43.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=993occurred in iteration=8, InterpolantAutomatonStates: 324, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 33.4s InterpolantComputationTime, 657 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 3728 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1080 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 136/17761 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 16:52:52,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE