./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/stack-2.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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:21:40,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:21:40,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:21:40,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:21:40,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:21:40,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:21:40,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:21:40,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:21:40,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:21:40,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:21:40,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:21:40,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:21:40,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:21:40,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:21:40,850 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:21:40,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:21:40,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:21:40,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:21:40,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:21:40,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:21:40,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:21:40,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:21:40,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:21:40,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:21:40,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:21:40,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:21:40,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:21:40,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:21:40,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:21:40,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:21:40,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:21:40,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:21:40,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:21:40,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:21:40,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:21:40,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:21:40,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:21:40,855 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2025-01-09 16:21:41,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:21:41,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:21:41,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:21:41,124 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:21:41,124 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:21:41,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2025-01-09 16:21:42,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e38a161aa/88df6484fc454edb8cbac05ef7c2301c/FLAG52292bdd5 [2025-01-09 16:21:42,661 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:21:42,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2025-01-09 16:21:42,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e38a161aa/88df6484fc454edb8cbac05ef7c2301c/FLAG52292bdd5 [2025-01-09 16:21:42,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e38a161aa/88df6484fc454edb8cbac05ef7c2301c [2025-01-09 16:21:42,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:21:42,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:21:42,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:21:42,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:21:42,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:21:42,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:21:42" (1/1) ... [2025-01-09 16:21:42,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73aa648c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:42, skipping insertion in model container [2025-01-09 16:21:42,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:21:42" (1/1) ... [2025-01-09 16:21:42,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:21:43,353 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/stack-2.i[41520,41533] [2025-01-09 16:21:43,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:21:43,398 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:21:43,439 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/stack-2.i[41520,41533] [2025-01-09 16:21:43,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:21:43,500 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:21:43,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43 WrapperNode [2025-01-09 16:21:43,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:21:43,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:21:43,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:21:43,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:21:43,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,540 INFO L138 Inliner]: procedures = 277, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 151 [2025-01-09 16:21:43,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:21:43,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:21:43,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:21:43,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:21:43,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,562 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 0, 1]. [2025-01-09 16:21:43,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,572 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:21:43,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:21:43,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:21:43,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:21:43,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (1/1) ... [2025-01-09 16:21:43,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:21:43,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:21:43,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:21:43,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-09 16:21:43,634 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-09 16:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-09 16:21:43,634 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-09 16:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 16:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:21:43,634 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:21:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:21:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:21:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:21:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:21:43,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:21:43,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:21:43,636 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:21:43,752 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:21:43,754 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:21:43,959 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:21:43,959 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:21:44,170 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:21:44,170 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:21:44,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:21:44 BoogieIcfgContainer [2025-01-09 16:21:44,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:21:44,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:21:44,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:21:44,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:21:44,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:21:42" (1/3) ... [2025-01-09 16:21:44,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf5c0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:21:44, skipping insertion in model container [2025-01-09 16:21:44,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:21:43" (2/3) ... [2025-01-09 16:21:44,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf5c0dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:21:44, skipping insertion in model container [2025-01-09 16:21:44,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:21:44" (3/3) ... [2025-01-09 16:21:44,180 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-2.i [2025-01-09 16:21:44,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:21:44,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-2.i that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 16:21:44,194 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:21:44,265 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:21:44,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 84 flow [2025-01-09 16:21:44,322 INFO L124 PetriNetUnfolderBase]: 5/33 cut-off events. [2025-01-09 16:21:44,324 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:21:44,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 5/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2025-01-09 16:21:44,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 35 transitions, 84 flow [2025-01-09 16:21:44,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 71 flow [2025-01-09 16:21:44,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:21:44,348 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;@7f1ad00a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:21:44,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:21:44,361 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:21:44,362 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-01-09 16:21:44,362 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:21:44,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:44,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:44,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:44,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash 535384231, now seen corresponding path program 1 times [2025-01-09 16:21:44,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:44,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313234429] [2025-01-09 16:21:44,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:44,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 16:21:44,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 16:21:44,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:44,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:44,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313234429] [2025-01-09 16:21:44,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313234429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:44,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:44,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:21:44,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772442364] [2025-01-09 16:21:44,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:44,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:21:44,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:44,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:21:44,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:21:44,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-01-09 16:21:44,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:44,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:44,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-01-09 16:21:44,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:45,091 INFO L124 PetriNetUnfolderBase]: 342/655 cut-off events. [2025-01-09 16:21:45,091 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-01-09 16:21:45,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 655 events. 342/655 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3021 event pairs, 75 based on Foata normal form. 44/652 useless extension candidates. Maximal degree in co-relation 1175. Up to 358 conditions per place. [2025-01-09 16:21:45,102 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 46 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-01-09 16:21:45,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 228 flow [2025-01-09 16:21:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:21:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:21:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-01-09 16:21:45,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-01-09 16:21:45,120 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 71 flow. Second operand 4 states and 90 transitions. [2025-01-09 16:21:45,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 56 transitions, 228 flow [2025-01-09 16:21:45,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 56 transitions, 219 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:21:45,130 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 82 flow [2025-01-09 16:21:45,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2025-01-09 16:21:45,136 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-01-09 16:21:45,136 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 82 flow [2025-01-09 16:21:45,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:45,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:45,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:45,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:21:45,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:45,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash -696488277, now seen corresponding path program 1 times [2025-01-09 16:21:45,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:45,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454454789] [2025-01-09 16:21:45,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:45,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:45,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:21:45,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:21:45,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:45,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:45,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:45,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454454789] [2025-01-09 16:21:45,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454454789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:45,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:45,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:21:45,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574556421] [2025-01-09 16:21:45,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:45,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:21:45,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:45,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:21:45,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:21:45,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-01-09 16:21:45,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:45,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:45,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-01-09 16:21:45,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:45,424 INFO L124 PetriNetUnfolderBase]: 341/639 cut-off events. [2025-01-09 16:21:45,425 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-01-09 16:21:45,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 639 events. 341/639 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2790 event pairs, 128 based on Foata normal form. 10/606 useless extension candidates. Maximal degree in co-relation 989. Up to 398 conditions per place. [2025-01-09 16:21:45,429 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2025-01-09 16:21:45,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 183 flow [2025-01-09 16:21:45,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:21:45,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:21:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-01-09 16:21:45,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-01-09 16:21:45,431 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 82 flow. Second operand 3 states and 62 transitions. [2025-01-09 16:21:45,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 183 flow [2025-01-09 16:21:45,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:21:45,432 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 92 flow [2025-01-09 16:21:45,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-01-09 16:21:45,433 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2025-01-09 16:21:45,433 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 92 flow [2025-01-09 16:21:45,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:45,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:45,433 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:45,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:21:45,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:45,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:45,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1233563578, now seen corresponding path program 1 times [2025-01-09 16:21:45,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:45,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829436045] [2025-01-09 16:21:45,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:45,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:45,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:21:45,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:21:45,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:45,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:45,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:45,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829436045] [2025-01-09 16:21:45,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829436045] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:21:45,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17961938] [2025-01-09 16:21:45,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:45,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:21:45,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:21:45,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:21:45,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:21:45,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:21:45,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:21:45,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:45,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:45,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:21:45,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:21:45,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:21:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:45,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:21:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:46,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17961938] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:21:46,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:21:46,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 16:21:46,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790411484] [2025-01-09 16:21:46,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:21:46,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:21:46,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:46,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:21:46,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:21:46,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-01-09 16:21:46,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 92 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:46,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:46,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-01-09 16:21:46,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:46,603 INFO L124 PetriNetUnfolderBase]: 1030/1974 cut-off events. [2025-01-09 16:21:46,603 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2025-01-09 16:21:46,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4119 conditions, 1974 events. 1030/1974 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 10221 event pairs, 79 based on Foata normal form. 0/1879 useless extension candidates. Maximal degree in co-relation 3565. Up to 390 conditions per place. [2025-01-09 16:21:46,616 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 137 selfloop transitions, 18 changer transitions 2/165 dead transitions. [2025-01-09 16:21:46,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 165 transitions, 729 flow [2025-01-09 16:21:46,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:21:46,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:21:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 269 transitions. [2025-01-09 16:21:46,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6404761904761904 [2025-01-09 16:21:46,619 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 92 flow. Second operand 12 states and 269 transitions. [2025-01-09 16:21:46,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 165 transitions, 729 flow [2025-01-09 16:21:46,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 165 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:21:46,624 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 237 flow [2025-01-09 16:21:46,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=237, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2025-01-09 16:21:46,627 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2025-01-09 16:21:46,627 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 237 flow [2025-01-09 16:21:46,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:46,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:46,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:46,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:21:46,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:21:46,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:46,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 369882592, now seen corresponding path program 1 times [2025-01-09 16:21:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50288232] [2025-01-09 16:21:46,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:46,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:21:46,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:21:46,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:46,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:46,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:46,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50288232] [2025-01-09 16:21:46,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50288232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:46,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:46,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:21:46,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097001253] [2025-01-09 16:21:46,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:46,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:21:46,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:46,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:21:46,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:21:46,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-01-09 16:21:46,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:46,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:46,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-01-09 16:21:46,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:47,110 INFO L124 PetriNetUnfolderBase]: 593/1232 cut-off events. [2025-01-09 16:21:47,110 INFO L125 PetriNetUnfolderBase]: For 452/452 co-relation queries the response was YES. [2025-01-09 16:21:47,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2780 conditions, 1232 events. 593/1232 cut-off events. For 452/452 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5893 event pairs, 204 based on Foata normal form. 60/1277 useless extension candidates. Maximal degree in co-relation 2653. Up to 580 conditions per place. [2025-01-09 16:21:47,120 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 42 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-01-09 16:21:47,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 309 flow [2025-01-09 16:21:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:21:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:21:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-01-09 16:21:47,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-01-09 16:21:47,122 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 237 flow. Second operand 3 states and 61 transitions. [2025-01-09 16:21:47,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 309 flow [2025-01-09 16:21:47,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 285 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-01-09 16:21:47,134 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 178 flow [2025-01-09 16:21:47,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-01-09 16:21:47,136 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2025-01-09 16:21:47,136 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 178 flow [2025-01-09 16:21:47,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:47,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:47,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:47,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:21:47,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:47,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:47,137 INFO L85 PathProgramCache]: Analyzing trace with hash 939953581, now seen corresponding path program 1 times [2025-01-09 16:21:47,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:47,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692991858] [2025-01-09 16:21:47,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:47,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:47,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:21:47,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:21:47,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:47,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692991858] [2025-01-09 16:21:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692991858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:21:47,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:21:47,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:21:47,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111580857] [2025-01-09 16:21:47,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:21:47,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:21:47,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:47,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:21:47,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:21:47,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-01-09 16:21:47,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:47,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:47,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-01-09 16:21:47,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:48,020 INFO L124 PetriNetUnfolderBase]: 653/1345 cut-off events. [2025-01-09 16:21:48,021 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2025-01-09 16:21:48,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 1345 events. 653/1345 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6570 event pairs, 145 based on Foata normal form. 0/1325 useless extension candidates. Maximal degree in co-relation 2725. Up to 840 conditions per place. [2025-01-09 16:21:48,049 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 60 selfloop transitions, 5 changer transitions 2/75 dead transitions. [2025-01-09 16:21:48,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 402 flow [2025-01-09 16:21:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:21:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:21:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2025-01-09 16:21:48,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2025-01-09 16:21:48,053 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 178 flow. Second operand 5 states and 101 transitions. [2025-01-09 16:21:48,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 402 flow [2025-01-09 16:21:48,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:21:48,059 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 210 flow [2025-01-09 16:21:48,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2025-01-09 16:21:48,060 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2025-01-09 16:21:48,062 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 210 flow [2025-01-09 16:21:48,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:48,062 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:48,062 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:48,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:21:48,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:48,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:48,063 INFO L85 PathProgramCache]: Analyzing trace with hash -149790678, now seen corresponding path program 1 times [2025-01-09 16:21:48,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:48,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065322671] [2025-01-09 16:21:48,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:48,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:48,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:21:48,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:21:48,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:48,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:48,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:21:48,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065322671] [2025-01-09 16:21:48,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065322671] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:21:48,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183704713] [2025-01-09 16:21:48,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:48,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:21:48,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:21:48,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:21:48,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:21:48,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:21:48,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:21:48,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:48,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:21:48,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 16:21:48,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:21:48,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:21:48,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:21:48,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2025-01-09 16:21:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:48,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:21:49,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2025-01-09 16:21:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:21:49,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183704713] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:21:49,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:21:49,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-09 16:21:49,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9214772] [2025-01-09 16:21:49,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:21:49,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:21:49,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:21:49,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:21:49,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:21:49,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2025-01-09 16:21:49,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 210 flow. Second operand has 14 states, 14 states have (on average 12.857142857142858) internal successors, (180), 14 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:49,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:21:49,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2025-01-09 16:21:49,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:50,358 INFO L124 PetriNetUnfolderBase]: 1248/2585 cut-off events. [2025-01-09 16:21:50,358 INFO L125 PetriNetUnfolderBase]: For 1253/1253 co-relation queries the response was YES. [2025-01-09 16:21:50,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5945 conditions, 2585 events. 1248/2585 cut-off events. For 1253/1253 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 14151 event pairs, 231 based on Foata normal form. 0/2553 useless extension candidates. Maximal degree in co-relation 4758. Up to 384 conditions per place. [2025-01-09 16:21:50,372 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 138 selfloop transitions, 28 changer transitions 0/174 dead transitions. [2025-01-09 16:21:50,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 174 transitions, 966 flow [2025-01-09 16:21:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:21:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:21:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 260 transitions. [2025-01-09 16:21:50,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-01-09 16:21:50,374 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 210 flow. Second operand 12 states and 260 transitions. [2025-01-09 16:21:50,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 174 transitions, 966 flow [2025-01-09 16:21:50,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 174 transitions, 961 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:21:50,382 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 376 flow [2025-01-09 16:21:50,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=376, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2025-01-09 16:21:50,382 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2025-01-09 16:21:50,382 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 376 flow [2025-01-09 16:21:50,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.857142857142858) internal successors, (180), 14 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:21:50,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:21:50,383 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:50,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:21:50,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:21:50,587 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 16:21:50,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:21:50,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1686418450, now seen corresponding path program 1 times [2025-01-09 16:21:50,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:21:50,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074161966] [2025-01-09 16:21:50,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:21:50,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:21:50,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:21:50,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:21:50,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:50,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:21:50,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:21:50,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:21:50,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:21:50,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:21:50,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:21:50,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:21:50,694 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:21:50,695 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-01-09 16:21:50,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-01-09 16:21:50,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-01-09 16:21:50,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-01-09 16:21:50,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-01-09 16:21:50,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-01-09 16:21:50,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:21:50,698 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:21:50,752 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:21:50,753 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:21:50,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:21:50 BasicIcfg [2025-01-09 16:21:50,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:21:50,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:21:50,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:21:50,759 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:21:50,760 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:21:44" (3/4) ... [2025-01-09 16:21:50,760 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 16:21:50,818 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 34. [2025-01-09 16:21:50,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:21:50,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:21:50,890 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:21:50,891 INFO L158 Benchmark]: Toolchain (without parser) took 7976.40ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 104.1MB in the beginning and 245.3MB in the end (delta: -141.2MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2025-01-09 16:21:50,895 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:21:50,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.99ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 75.2MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:21:50,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.46ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 72.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:21:50,895 INFO L158 Benchmark]: Boogie Preprocessor took 44.06ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 70.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:21:50,896 INFO L158 Benchmark]: RCFGBuilder took 585.58ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 96.7MB in the end (delta: -26.6MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2025-01-09 16:21:50,896 INFO L158 Benchmark]: TraceAbstraction took 6585.49ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 95.9MB in the beginning and 254.6MB in the end (delta: -158.6MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2025-01-09 16:21:50,896 INFO L158 Benchmark]: Witness Printer took 131.57ms. Allocated memory is still 360.7MB. Free memory was 254.6MB in the beginning and 245.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:21:50,899 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 587.99ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 75.2MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.46ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 72.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.06ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 70.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 585.58ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 96.7MB in the end (delta: -26.6MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6585.49ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 95.9MB in the beginning and 254.6MB in the end (delta: -158.6MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. * Witness Printer took 131.57ms. Allocated memory is still 360.7MB. Free memory was 254.6MB in the beginning and 245.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=1, top=1] [L1007] COND TRUE 2 i<(5) VAL [arr={3:0}, flag=1, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 6 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: 6.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 967 IncrementalHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 2 mSDtfsCounter, 967 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=376occurred in iteration=6, InterpolantAutomatonStates: 39, 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.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 164 ConstructedInterpolants, 7 QuantifiedInterpolants, 1583 SizeOfPredicates, 21 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 0/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 16:21:50,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE