./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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-C-DAC/pthread-demo-datarace-3.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 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:08:02,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:08:02,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:08:02,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:08:02,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:08:02,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:08:02,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:08:02,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:08:02,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:08:02,185 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:08:02,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:08:02,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:08:02,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:08:02,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:08:02,186 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:08:02,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:08:02,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:08:02,187 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:08:02,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:08:02,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:08:02,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:08:02,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:08:02,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:08:02,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:08:02,188 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:08:02,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:08:02,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:08:02,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:08:02,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:08:02,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:08:02,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:08:02,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:08:02,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:08:02,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:08:02,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:08:02,189 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:08:02,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:08:02,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:08:02,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:08:02,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:08:02,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:08:02,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:08:02,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:08:02,190 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2025-02-08 01:08:02,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:08:02,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:08:02,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:08:02,464 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:08:02,464 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:08:02,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-02-08 01:08:03,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/662f5c5cd/b35be03fde204f19b37f0de79d2d3795/FLAG899e6a974 [2025-02-08 01:08:04,116 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:08:04,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-3.i [2025-02-08 01:08:04,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/662f5c5cd/b35be03fde204f19b37f0de79d2d3795/FLAG899e6a974 [2025-02-08 01:08:04,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/662f5c5cd/b35be03fde204f19b37f0de79d2d3795 [2025-02-08 01:08:04,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:08:04,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:08:04,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:08:04,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:08:04,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:08:04,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ccc7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04, skipping insertion in model container [2025-02-08 01:08:04,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:08:04,272 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-C-DAC/pthread-demo-datarace-3.i[818,831] [2025-02-08 01:08:04,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:08:04,520 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:08:04,527 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-C-DAC/pthread-demo-datarace-3.i[818,831] [2025-02-08 01:08:04,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:08:04,601 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:08:04,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04 WrapperNode [2025-02-08 01:08:04,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:08:04,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:08:04,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:08:04,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:08:04,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,629 INFO L138 Inliner]: procedures = 364, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2025-02-08 01:08:04,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:08:04,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:08:04,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:08:04,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:08:04,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,644 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-02-08 01:08:04,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:08:04,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:08:04,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:08:04,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:08:04,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (1/1) ... [2025-02-08 01:08:04,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:08:04,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:08:04,677 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-02-08 01:08:04,679 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-02-08 01:08:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:08:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:08:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-02-08 01:08:04,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-02-08 01:08:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:08:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:08:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:08:04,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:08:04,696 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:08:04,789 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:08:04,791 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:08:04,973 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:08:04,973 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:08:05,183 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:08:05,184 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:08:05,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:08:05 BoogieIcfgContainer [2025-02-08 01:08:05,184 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:08:05,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:08:05,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:08:05,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:08:05,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:08:04" (1/3) ... [2025-02-08 01:08:05,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23aa2c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:08:05, skipping insertion in model container [2025-02-08 01:08:05,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:04" (2/3) ... [2025-02-08 01:08:05,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23aa2c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:08:05, skipping insertion in model container [2025-02-08 01:08:05,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:08:05" (3/3) ... [2025-02-08 01:08:05,193 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-02-08 01:08:05,205 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:08:05,206 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-08 01:08:05,207 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:08:05,280 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 01:08:05,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 51 flow [2025-02-08 01:08:05,335 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2025-02-08 01:08:05,337 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 01:08:05,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 21 events. 3/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-02-08 01:08:05,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 51 flow [2025-02-08 01:08:05,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 18 transitions, 42 flow [2025-02-08 01:08:05,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:08:05,374 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;@63b792e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:08:05,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 01:08:05,385 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:08:05,387 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-02-08 01:08:05,387 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 01:08:05,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:05,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:05,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:08:05,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:05,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1871012907, now seen corresponding path program 1 times [2025-02-08 01:08:05,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:05,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724366454] [2025-02-08 01:08:05,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:05,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:05,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 01:08:05,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 01:08:05,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:05,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:05,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:05,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724366454] [2025-02-08 01:08:05,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724366454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:05,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:08:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341164344] [2025-02-08 01:08:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:05,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:08:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:05,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:08:05,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:08:05,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-02-08 01:08:05,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:05,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:05,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-02-08 01:08:05,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:05,794 INFO L124 PetriNetUnfolderBase]: 37/88 cut-off events. [2025-02-08 01:08:05,794 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 01:08:05,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 88 events. 37/88 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 267 event pairs, 15 based on Foata normal form. 6/93 useless extension candidates. Maximal degree in co-relation 154. Up to 53 conditions per place. [2025-02-08 01:08:05,796 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 20 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-02-08 01:08:05,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 26 transitions, 102 flow [2025-02-08 01:08:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:08:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:08:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-02-08 01:08:05,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-02-08 01:08:05,811 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 42 flow. Second operand 3 states and 41 transitions. [2025-02-08 01:08:05,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 26 transitions, 102 flow [2025-02-08 01:08:05,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 26 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:08:05,819 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 50 flow [2025-02-08 01:08:05,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2025-02-08 01:08:05,827 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 1 predicate places. [2025-02-08 01:08:05,828 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 50 flow [2025-02-08 01:08:05,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:05,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:05,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:05,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:08:05,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:08:05,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:05,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1908047230, now seen corresponding path program 1 times [2025-02-08 01:08:05,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:05,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590026759] [2025-02-08 01:08:05,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:05,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:05,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 01:08:05,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 01:08:05,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:05,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:08:05,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:05,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590026759] [2025-02-08 01:08:05,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590026759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:05,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:08:05,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991747434] [2025-02-08 01:08:05,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:05,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:08:05,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:05,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:08:05,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:08:05,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 22 [2025-02-08 01:08:05,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:05,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:05,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 22 [2025-02-08 01:08:05,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:06,056 INFO L124 PetriNetUnfolderBase]: 51/121 cut-off events. [2025-02-08 01:08:06,058 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-02-08 01:08:06,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 121 events. 51/121 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 383 event pairs, 20 based on Foata normal form. 5/125 useless extension candidates. Maximal degree in co-relation 50. Up to 65 conditions per place. [2025-02-08 01:08:06,061 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 20 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-02-08 01:08:06,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 27 transitions, 118 flow [2025-02-08 01:08:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:08:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:08:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-02-08 01:08:06,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-02-08 01:08:06,063 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 50 flow. Second operand 3 states and 42 transitions. [2025-02-08 01:08:06,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 27 transitions, 118 flow [2025-02-08 01:08:06,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:08:06,064 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 60 flow [2025-02-08 01:08:06,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-02-08 01:08:06,066 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2025-02-08 01:08:06,066 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 60 flow [2025-02-08 01:08:06,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:06,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:06,067 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:06,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:08:06,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:08:06,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash 929167751, now seen corresponding path program 1 times [2025-02-08 01:08:06,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:06,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461918416] [2025-02-08 01:08:06,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:06,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:08:06,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:08:06,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:06,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:08:06,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:06,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461918416] [2025-02-08 01:08:06,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461918416] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:08:06,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763943131] [2025-02-08 01:08:06,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:06,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:08:06,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:08:06,232 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-02-08 01:08:06,233 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-02-08 01:08:06,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:08:06,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:08:06,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:06,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:06,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 01:08:06,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:08:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:08:06,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:08:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:08:06,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763943131] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:08:06,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:08:06,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-08 01:08:06,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113480499] [2025-02-08 01:08:06,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:08:06,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:08:06,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:06,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:08:06,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:08:06,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-02-08 01:08:06,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 60 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-02-08 01:08:06,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:06,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-02-08 01:08:06,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:06,800 INFO L124 PetriNetUnfolderBase]: 185/392 cut-off events. [2025-02-08 01:08:06,800 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-02-08 01:08:06,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 392 events. 185/392 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1407 event pairs, 6 based on Foata normal form. 47/439 useless extension candidates. Maximal degree in co-relation 171. Up to 93 conditions per place. [2025-02-08 01:08:06,805 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 80 selfloop transitions, 33 changer transitions 0/116 dead transitions. [2025-02-08 01:08:06,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 116 transitions, 552 flow [2025-02-08 01:08:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 01:08:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-08 01:08:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 207 transitions. [2025-02-08 01:08:06,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5880681818181818 [2025-02-08 01:08:06,811 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 60 flow. Second operand 16 states and 207 transitions. [2025-02-08 01:08:06,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 116 transitions, 552 flow [2025-02-08 01:08:06,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 116 transitions, 546 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:08:06,815 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 332 flow [2025-02-08 01:08:06,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=332, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-02-08 01:08:06,816 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 30 predicate places. [2025-02-08 01:08:06,817 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 332 flow [2025-02-08 01:08:06,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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-02-08 01:08:06,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:06,817 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:06,826 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-02-08 01:08:07,022 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-02-08 01:08:07,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:08:07,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:07,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1508262653, now seen corresponding path program 2 times [2025-02-08 01:08:07,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:07,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497516168] [2025-02-08 01:08:07,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:08:07,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:07,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 01:08:07,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 01:08:07,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:08:07,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:08:07,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:07,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497516168] [2025-02-08 01:08:07,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497516168] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:08:07,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966678979] [2025-02-08 01:08:07,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:08:07,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:08:07,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:08:07,201 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-02-08 01:08:07,205 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-02-08 01:08:07,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 01:08:07,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 01:08:07,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:08:07,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:07,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 01:08:07,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:08:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:08:07,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:08:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:08:07,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966678979] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:08:07,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:08:07,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 01:08:07,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726379680] [2025-02-08 01:08:07,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:08:07,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 01:08:07,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:07,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 01:08:07,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:08:07,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-02-08 01:08:07,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 332 flow. Second operand has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 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-02-08 01:08:07,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:07,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-02-08 01:08:07,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:07,733 INFO L124 PetriNetUnfolderBase]: 377/773 cut-off events. [2025-02-08 01:08:07,733 INFO L125 PetriNetUnfolderBase]: For 4031/4058 co-relation queries the response was YES. [2025-02-08 01:08:07,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 773 events. 377/773 cut-off events. For 4031/4058 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2787 event pairs, 29 based on Foata normal form. 45/815 useless extension candidates. Maximal degree in co-relation 2155. Up to 212 conditions per place. [2025-02-08 01:08:07,742 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 130 selfloop transitions, 36 changer transitions 0/170 dead transitions. [2025-02-08 01:08:07,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 170 transitions, 1442 flow [2025-02-08 01:08:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:08:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 01:08:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2025-02-08 01:08:07,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-02-08 01:08:07,744 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 332 flow. Second operand 12 states and 168 transitions. [2025-02-08 01:08:07,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 170 transitions, 1442 flow [2025-02-08 01:08:07,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 170 transitions, 1314 flow, removed 44 selfloop flow, removed 2 redundant places. [2025-02-08 01:08:07,765 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 552 flow [2025-02-08 01:08:07,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=552, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2025-02-08 01:08:07,766 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 46 predicate places. [2025-02-08 01:08:07,766 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 552 flow [2025-02-08 01:08:07,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 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-02-08 01:08:07,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:07,766 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:07,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 01:08:07,966 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-02-08 01:08:07,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:08:07,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash -898958301, now seen corresponding path program 3 times [2025-02-08 01:08:07,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:07,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846700355] [2025-02-08 01:08:07,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:08:07,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:07,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-02-08 01:08:07,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 66 statements. [2025-02-08 01:08:07,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 01:08:07,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 01:08:08,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:08,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846700355] [2025-02-08 01:08:08,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846700355] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:08:08,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581753087] [2025-02-08 01:08:08,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:08:08,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:08:08,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:08:08,047 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-02-08 01:08:08,048 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-02-08 01:08:08,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-02-08 01:08:08,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 66 statements. [2025-02-08 01:08:08,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 01:08:08,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:08,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 01:08:08,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:08:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 01:08:08,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:08:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 01:08:08,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581753087] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:08:08,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:08:08,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-08 01:08:08,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136557263] [2025-02-08 01:08:08,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:08:08,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:08:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:08,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:08:08,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:08:08,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-02-08 01:08:08,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 552 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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-02-08 01:08:08,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:08,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-02-08 01:08:08,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:08,493 INFO L124 PetriNetUnfolderBase]: 927/1941 cut-off events. [2025-02-08 01:08:08,493 INFO L125 PetriNetUnfolderBase]: For 9332/9356 co-relation queries the response was YES. [2025-02-08 01:08:08,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7023 conditions, 1941 events. 927/1941 cut-off events. For 9332/9356 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8959 event pairs, 146 based on Foata normal form. 211/2129 useless extension candidates. Maximal degree in co-relation 5696. Up to 335 conditions per place. [2025-02-08 01:08:08,508 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 122 selfloop transitions, 20 changer transitions 0/151 dead transitions. [2025-02-08 01:08:08,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 151 transitions, 1548 flow [2025-02-08 01:08:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:08:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:08:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-02-08 01:08:08,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6306818181818182 [2025-02-08 01:08:08,510 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 552 flow. Second operand 8 states and 111 transitions. [2025-02-08 01:08:08,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 151 transitions, 1548 flow [2025-02-08 01:08:08,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 151 transitions, 1506 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:08:08,523 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 648 flow [2025-02-08 01:08:08,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=648, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2025-02-08 01:08:08,524 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 55 predicate places. [2025-02-08 01:08:08,524 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 648 flow [2025-02-08 01:08:08,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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-02-08 01:08:08,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:08,524 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:08,531 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-02-08 01:08:08,729 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-02-08 01:08:08,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:08:08,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:08,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1950904543, now seen corresponding path program 4 times [2025-02-08 01:08:08,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:08,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762315754] [2025-02-08 01:08:08,730 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:08:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:08,745 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 78 statements into 2 equivalence classes. [2025-02-08 01:08:08,763 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 01:08:08,763 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:08:08,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-02-08 01:08:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:08,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762315754] [2025-02-08 01:08:08,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762315754] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:08:08,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308903324] [2025-02-08 01:08:08,948 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:08:08,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:08:08,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:08:08,951 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-02-08 01:08:08,953 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-02-08 01:08:09,030 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 78 statements into 2 equivalence classes. [2025-02-08 01:08:09,055 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 01:08:09,055 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 01:08:09,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:09,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 01:08:09,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:08:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-02-08 01:08:09,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:08:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-02-08 01:08:09,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308903324] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:08:09,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:08:09,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-02-08 01:08:09,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069475699] [2025-02-08 01:08:09,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:08:09,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 01:08:09,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:09,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 01:08:09,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-02-08 01:08:09,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-02-08 01:08:09,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 648 flow. Second operand has 16 states, 16 states have (on average 8.6875) internal successors, (139), 16 states have internal predecessors, (139), 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-02-08 01:08:09,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:09,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-02-08 01:08:09,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:09,925 INFO L124 PetriNetUnfolderBase]: 1967/4089 cut-off events. [2025-02-08 01:08:09,926 INFO L125 PetriNetUnfolderBase]: For 30456/30527 co-relation queries the response was YES. [2025-02-08 01:08:09,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17446 conditions, 4089 events. 1967/4089 cut-off events. For 30456/30527 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 21749 event pairs, 214 based on Foata normal form. 447/4506 useless extension candidates. Maximal degree in co-relation 14674. Up to 727 conditions per place. [2025-02-08 01:08:09,955 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 258 selfloop transitions, 28 changer transitions 0/295 dead transitions. [2025-02-08 01:08:09,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 295 transitions, 3170 flow [2025-02-08 01:08:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 01:08:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-08 01:08:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 227 transitions. [2025-02-08 01:08:09,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6448863636363636 [2025-02-08 01:08:09,956 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 648 flow. Second operand 16 states and 227 transitions. [2025-02-08 01:08:09,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 295 transitions, 3170 flow [2025-02-08 01:08:09,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 295 transitions, 3102 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-02-08 01:08:09,984 INFO L231 Difference]: Finished difference. Result has 97 places, 82 transitions, 828 flow [2025-02-08 01:08:09,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=828, PETRI_PLACES=97, PETRI_TRANSITIONS=82} [2025-02-08 01:08:09,985 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 77 predicate places. [2025-02-08 01:08:09,986 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 82 transitions, 828 flow [2025-02-08 01:08:09,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.6875) internal successors, (139), 16 states have internal predecessors, (139), 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-02-08 01:08:09,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:09,986 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:09,992 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-02-08 01:08:10,186 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-02-08 01:08:10,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:08:10,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:10,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1876257235, now seen corresponding path program 5 times [2025-02-08 01:08:10,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:10,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809168318] [2025-02-08 01:08:10,187 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:08:10,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:10,204 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 15 equivalence classes. [2025-02-08 01:08:10,217 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 01:08:10,217 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-02-08 01:08:10,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-02-08 01:08:10,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:10,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809168318] [2025-02-08 01:08:10,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809168318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:08:10,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832771327] [2025-02-08 01:08:10,558 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:08:10,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:08:10,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:08:10,560 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-02-08 01:08:10,561 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-02-08 01:08:10,646 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 102 statements into 15 equivalence classes. [2025-02-08 01:08:10,683 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 01:08:10,684 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-02-08 01:08:10,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:10,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 01:08:10,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:08:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-02-08 01:08:10,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:08:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-02-08 01:08:11,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832771327] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:08:11,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:08:11,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2025-02-08 01:08:11,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569562986] [2025-02-08 01:08:11,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:08:11,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 01:08:11,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:11,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 01:08:11,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-02-08 01:08:11,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2025-02-08 01:08:11,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 82 transitions, 828 flow. Second operand has 22 states, 22 states have (on average 8.636363636363637) internal successors, (190), 22 states have internal predecessors, (190), 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-02-08 01:08:11,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:11,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2025-02-08 01:08:11,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:12,013 INFO L124 PetriNetUnfolderBase]: 2746/5701 cut-off events. [2025-02-08 01:08:12,013 INFO L125 PetriNetUnfolderBase]: For 64848/64956 co-relation queries the response was YES. [2025-02-08 01:08:12,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25776 conditions, 5701 events. 2746/5701 cut-off events. For 64848/64956 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 31669 event pairs, 238 based on Foata normal form. 390/6055 useless extension candidates. Maximal degree in co-relation 22018. Up to 1022 conditions per place. [2025-02-08 01:08:12,080 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 360 selfloop transitions, 34 changer transitions 0/403 dead transitions. [2025-02-08 01:08:12,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 403 transitions, 4426 flow [2025-02-08 01:08:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 01:08:12,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 01:08:12,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 309 transitions. [2025-02-08 01:08:12,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6384297520661157 [2025-02-08 01:08:12,083 INFO L175 Difference]: Start difference. First operand has 97 places, 82 transitions, 828 flow. Second operand 22 states and 309 transitions. [2025-02-08 01:08:12,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 403 transitions, 4426 flow [2025-02-08 01:08:12,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 403 transitions, 4396 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 01:08:12,144 INFO L231 Difference]: Finished difference. Result has 120 places, 89 transitions, 1018 flow [2025-02-08 01:08:12,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1018, PETRI_PLACES=120, PETRI_TRANSITIONS=89} [2025-02-08 01:08:12,147 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 100 predicate places. [2025-02-08 01:08:12,147 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 89 transitions, 1018 flow [2025-02-08 01:08:12,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.636363636363637) internal successors, (190), 22 states have internal predecessors, (190), 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-02-08 01:08:12,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:12,147 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:12,155 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-02-08 01:08:12,349 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-02-08 01:08:12,349 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:08:12,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash 189622983, now seen corresponding path program 6 times [2025-02-08 01:08:12,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:12,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377946680] [2025-02-08 01:08:12,350 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:08:12,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:12,367 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 120 statements into 21 equivalence classes. [2025-02-08 01:08:12,407 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 01:08:12,407 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-02-08 01:08:12,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-08 01:08:12,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:12,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377946680] [2025-02-08 01:08:12,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377946680] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:08:12,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527096202] [2025-02-08 01:08:12,639 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:08:12,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:08:12,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:08:12,642 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-02-08 01:08:12,643 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-02-08 01:08:12,724 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 120 statements into 21 equivalence classes. [2025-02-08 01:08:12,794 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 01:08:12,794 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2025-02-08 01:08:12,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:12,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 01:08:12,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:08:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-08 01:08:12,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:08:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-02-08 01:08:13,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527096202] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:08:13,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:08:13,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-02-08 01:08:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956866279] [2025-02-08 01:08:13,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:08:13,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 01:08:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:13,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 01:08:13,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-02-08 01:08:13,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 22 [2025-02-08 01:08:13,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 89 transitions, 1018 flow. Second operand has 23 states, 23 states have (on average 10.869565217391305) internal successors, (250), 23 states have internal predecessors, (250), 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-02-08 01:08:13,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:13,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 22 [2025-02-08 01:08:13,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:14,456 INFO L124 PetriNetUnfolderBase]: 4231/8616 cut-off events. [2025-02-08 01:08:14,456 INFO L125 PetriNetUnfolderBase]: For 138627/138670 co-relation queries the response was YES. [2025-02-08 01:08:14,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42689 conditions, 8616 events. 4231/8616 cut-off events. For 138627/138670 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 54583 event pairs, 99 based on Foata normal form. 423/9036 useless extension candidates. Maximal degree in co-relation 40890. Up to 2163 conditions per place. [2025-02-08 01:08:14,549 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 627 selfloop transitions, 66 changer transitions 0/700 dead transitions. [2025-02-08 01:08:14,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 700 transitions, 11578 flow [2025-02-08 01:08:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 01:08:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 01:08:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 312 transitions. [2025-02-08 01:08:14,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6446280991735537 [2025-02-08 01:08:14,550 INFO L175 Difference]: Start difference. First operand has 120 places, 89 transitions, 1018 flow. Second operand 22 states and 312 transitions. [2025-02-08 01:08:14,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 700 transitions, 11578 flow [2025-02-08 01:08:14,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 700 transitions, 10952 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-02-08 01:08:14,679 INFO L231 Difference]: Finished difference. Result has 139 places, 122 transitions, 1532 flow [2025-02-08 01:08:14,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1532, PETRI_PLACES=139, PETRI_TRANSITIONS=122} [2025-02-08 01:08:14,680 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 119 predicate places. [2025-02-08 01:08:14,680 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 122 transitions, 1532 flow [2025-02-08 01:08:14,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.869565217391305) internal successors, (250), 23 states have internal predecessors, (250), 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-02-08 01:08:14,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:14,681 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:14,776 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-02-08 01:08:14,881 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-02-08 01:08:14,882 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-02-08 01:08:14,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:14,882 INFO L85 PathProgramCache]: Analyzing trace with hash 945177379, now seen corresponding path program 7 times [2025-02-08 01:08:14,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:14,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953122393] [2025-02-08 01:08:14,883 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:08:14,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:14,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 01:08:14,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 01:08:14,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:14,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:08:14,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 01:08:14,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 01:08:14,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 01:08:14,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:14,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:08:15,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 01:08:15,008 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 01:08:15,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-08 01:08:15,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-02-08 01:08:15,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:08:15,011 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2025-02-08 01:08:15,100 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:08:15,101 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:08:15,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:08:15 BasicIcfg [2025-02-08 01:08:15,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:08:15,105 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:08:15,105 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:08:15,105 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:08:15,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:08:05" (3/4) ... [2025-02-08 01:08:15,108 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 01:08:15,223 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 47. [2025-02-08 01:08:15,287 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:08:15,288 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:08:15,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:08:15,288 INFO L158 Benchmark]: Toolchain (without parser) took 11145.60ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 122.2MB in the beginning and 363.7MB in the end (delta: -241.5MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. [2025-02-08 01:08:15,289 INFO L158 Benchmark]: CDTParser took 1.24ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:08:15,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.88ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 85.1MB in the end (delta: 37.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 01:08:15,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.10ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 82.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:08:15,289 INFO L158 Benchmark]: Boogie Preprocessor took 20.67ms. Allocated memory is still 167.8MB. Free memory was 82.6MB in the beginning and 80.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:08:15,289 INFO L158 Benchmark]: IcfgBuilder took 532.64ms. Allocated memory is still 167.8MB. Free memory was 80.8MB in the beginning and 39.5MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 01:08:15,290 INFO L158 Benchmark]: TraceAbstraction took 9918.69ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 38.8MB in the beginning and 388.8MB in the end (delta: -350.0MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2025-02-08 01:08:15,290 INFO L158 Benchmark]: Witness Printer took 182.74ms. Allocated memory is still 553.6MB. Free memory was 388.8MB in the beginning and 363.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:08:15,291 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.24ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.88ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 85.1MB in the end (delta: 37.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.10ms. Allocated memory is still 167.8MB. Free memory was 85.1MB in the beginning and 82.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.67ms. Allocated memory is still 167.8MB. Free memory was 82.6MB in the beginning and 80.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 532.64ms. Allocated memory is still 167.8MB. Free memory was 80.8MB in the beginning and 39.5MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9918.69ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 38.8MB in the beginning and 388.8MB in the end (delta: -350.0MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Witness Printer took 182.74ms. Allocated memory is still 553.6MB. Free memory was 388.8MB in the beginning and 363.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1340] 0 pthread_t mythread; [L1341] 0 int i; [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [\old(arg)={0:0}, myglobal=0, mythread=-1] [L1324] 1 int i,j; [L1325] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, myglobal=0] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=0, myglobal=0] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=0, j=1, myglobal=1] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=1, myglobal=1] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=1, j=2, myglobal=2] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=2, myglobal=2] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=2, j=3, myglobal=3] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=3, myglobal=3] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=4, myglobal=4] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=4, myglobal=4] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=4, j=5, myglobal=5] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=5, myglobal=5] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=5, j=6, myglobal=6] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=6, myglobal=6] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=6, j=7, myglobal=7] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=7, myglobal=7] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=8, myglobal=8] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=8, myglobal=8] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=8, j=9, myglobal=9] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=9, myglobal=9] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=9, j=10, myglobal=10] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=10, myglobal=10] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=10, j=11, myglobal=11] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=11, myglobal=11] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=11, j=12, myglobal=12] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=12, myglobal=12] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=12, j=13, myglobal=13] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=13, myglobal=13] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=13, j=14, myglobal=14] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=14, myglobal=14] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=14, j=15, myglobal=15] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=15, myglobal=15] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=15, j=16, myglobal=16] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=16, myglobal=16] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=16, j=17, myglobal=17] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=17, myglobal=17] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=17, j=18, myglobal=18] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=18, myglobal=18] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=18, j=19, myglobal=19] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1325] COND TRUE 1 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1328] 1 j=myglobal VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=19, myglobal=19] [L1330] 1 j=j+1 [L1333] 1 myglobal=j VAL [\old(arg)={0:0}, arg={0:0}, i=19, j=20, myglobal=20] [L1325] 1 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, j=20, myglobal=20] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) [L1352] 0 i=0 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=20, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=20, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=0, i=20, j=20, myglobal=21, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=21, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=21, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=1, i=20, j=20, myglobal=22, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=22, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=22, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=2, i=20, j=20, myglobal=23, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=23, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=23, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=3, j=20, myglobal=24, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=24, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=24, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=4, j=20, myglobal=25, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=25, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=25, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=5, j=20, myglobal=26, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=26, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=26, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=6, j=20, myglobal=27, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=27, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=27, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=7, j=20, myglobal=28, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=28, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=28, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=8, j=20, myglobal=29, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=29, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=29, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=9, j=20, myglobal=30, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=30, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=30, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=10, i=20, j=20, myglobal=31, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=31, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=31, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=11, i=20, j=20, myglobal=32, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=32, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=32, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=12, i=20, j=20, myglobal=33, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=33, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=33, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=13, i=20, j=20, myglobal=34, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=34, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=34, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=14, i=20, j=20, myglobal=35, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=35, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=35, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=15, i=20, j=20, myglobal=36, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=36, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=36, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=16, i=20, j=20, myglobal=37, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=37, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=37, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=17, i=20, j=20, myglobal=38, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=38, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=38, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=18, i=20, j=20, myglobal=39, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=39, mythread=-1] [L1352] COND TRUE 0 i<20 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=39, mythread=-1] [L1355] 0 myglobal=myglobal+1 VAL [\old(arg)={0:0}, arg={0:0}, i=19, i=20, j=20, myglobal=40, mythread=-1] [L1352] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1352] COND FALSE 0 !(i<20) VAL [\old(arg)={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1325] COND FALSE 1 !(i<20) [L1336] 1 return ((void *)0); [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, i=20, i=20, j=20, myglobal=40, mythread=-1] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=20, myglobal=40] [L13] 0 reach_error() VAL [\old(arg)={0:0}, \old(cond)=0, \result={0:0}, arg={0:0}, cond=0, i=20, j=20, myglobal=40] - UnprovableResult [Line: 1342]: 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 3 procedures, 28 locations, 2 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: 9.7s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 771 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1024 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 6 mSDtfsCounter, 1024 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 804 SyntacticMatches, 12 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1532occurred in iteration=8, InterpolantAutomatonStates: 102, 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.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 1263 ConstructedInterpolants, 0 QuantifiedInterpolants, 2611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1272 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 3391/5230 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-02-08 01:08:15,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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