./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-11.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/fib_unsafe-11.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 5b16c68af06359cf155927d2335a825cd179e6a83a999e1ead7a6952268e92c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:20:02,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:20:02,482 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:20:02,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:20:02,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:20:02,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:20:02,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:20:02,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:20:02,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:20:02,513 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:20:02,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:20:02,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:20:02,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:20:02,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:20:02,515 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:20:02,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:20:02,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:20:02,515 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:20:02,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:20:02,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:20:02,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:20:02,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:20:02,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:20:02,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:20:02,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:20:02,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:20:02,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:20:02,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:20:02,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:20:02,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:20:02,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:20:02,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:20:02,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:20:02,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:20:02,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:20:02,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:20:02,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:20:02,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:20:02,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:20:02,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:20:02,517 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:20:02,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:20:02,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:20:02,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:20:02,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:20:02,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:20:02,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:20:02,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:20:02,518 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 -> 5b16c68af06359cf155927d2335a825cd179e6a83a999e1ead7a6952268e92c6 [2025-01-09 16:20:02,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:20:02,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:20:02,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:20:02,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:20:02,791 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:20:02,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-11.i [2025-01-09 16:20:04,046 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86e54fe42/f30f24fd738c40439b6b2213b3af2449/FLAG60bb9eeb6 [2025-01-09 16:20:04,341 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:20:04,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-11.i [2025-01-09 16:20:04,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86e54fe42/f30f24fd738c40439b6b2213b3af2449/FLAG60bb9eeb6 [2025-01-09 16:20:04,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/86e54fe42/f30f24fd738c40439b6b2213b3af2449 [2025-01-09 16:20:04,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:20:04,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:20:04,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:20:04,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:20:04,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:20:04,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2217ad44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04, skipping insertion in model container [2025-01-09 16:20:04,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:20:04,736 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/fib_unsafe-11.i[30243,30256] [2025-01-09 16:20:04,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:20:04,765 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:20:04,794 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/fib_unsafe-11.i[30243,30256] [2025-01-09 16:20:04,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:20:04,832 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:20:04,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04 WrapperNode [2025-01-09 16:20:04,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:20:04,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:20:04,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:20:04,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:20:04,839 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:20:04" (1/1) ... [2025-01-09 16:20:04,849 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:20:04" (1/1) ... [2025-01-09 16:20:04,863 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-01-09 16:20:04,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:20:04,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:20:04,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:20:04,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:20:04,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,883 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:20:04,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:20:04,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:20:04,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:20:04,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:20:04,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (1/1) ... [2025-01-09 16:20:04,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:20:04,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:04,930 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:20:04,938 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:20:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-09 16:20:04,960 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-09 16:20:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-09 16:20:04,960 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-09 16:20:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:20:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:20:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:20:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:20:04,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:20:04,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:20:04,961 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:20:05,049 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:20:05,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:20:05,131 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:20:05,131 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:20:05,209 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:20:05,210 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:20:05,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:20:05 BoogieIcfgContainer [2025-01-09 16:20:05,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:20:05,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:20:05,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:20:05,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:20:05,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:20:04" (1/3) ... [2025-01-09 16:20:05,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e36dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:20:05, skipping insertion in model container [2025-01-09 16:20:05,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:04" (2/3) ... [2025-01-09 16:20:05,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e36dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:20:05, skipping insertion in model container [2025-01-09 16:20:05,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:20:05" (3/3) ... [2025-01-09 16:20:05,218 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-11.i [2025-01-09 16:20:05,229 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:20:05,230 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-11.i that has 3 procedures, 26 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:20:05,230 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:20:05,267 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:20:05,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-01-09 16:20:05,325 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-01-09 16:20:05,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:20:05,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-01-09 16:20:05,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-01-09 16:20:05,334 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-01-09 16:20:05,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:20:05,352 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;@59882ce0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:20:05,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:20:05,366 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:20:05,369 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-01-09 16:20:05,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:20:05,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:05,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:05,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:20:05,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash 55803422, now seen corresponding path program 1 times [2025-01-09 16:20:05,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:05,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560674116] [2025-01-09 16:20:05,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:05,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:20:05,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:20:05,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:05,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:05,548 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:20:05,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:05,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560674116] [2025-01-09 16:20:05,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560674116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:05,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:05,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:20:05,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537368977] [2025-01-09 16:20:05,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:05,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:20:05,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:05,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:20:05,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:20:05,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:20:05,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:20:05,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:05,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:20:05,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:05,675 INFO L124 PetriNetUnfolderBase]: 115/223 cut-off events. [2025-01-09 16:20:05,676 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:20:05,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 223 events. 115/223 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 692 event pairs, 20 based on Foata normal form. 9/209 useless extension candidates. Maximal degree in co-relation 398. Up to 118 conditions per place. [2025-01-09 16:20:05,679 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 20 selfloop transitions, 2 changer transitions 1/33 dead transitions. [2025-01-09 16:20:05,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 118 flow [2025-01-09 16:20:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:20:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:20:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-01-09 16:20:05,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7011494252873564 [2025-01-09 16:20:05,691 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 61 transitions. [2025-01-09 16:20:05,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 118 flow [2025-01-09 16:20:05,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:20:05,696 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 66 flow [2025-01-09 16:20:05,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-01-09 16:20:05,699 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-01-09 16:20:05,700 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 66 flow [2025-01-09 16:20:05,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:20:05,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:05,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:05,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:20:05,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:20:05,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1745155739, now seen corresponding path program 1 times [2025-01-09 16:20:05,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:05,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251068612] [2025-01-09 16:20:05,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:05,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:05,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:20:05,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:20:05,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:05,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:05,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251068612] [2025-01-09 16:20:05,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251068612] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668949936] [2025-01-09 16:20:05,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:05,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:05,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:05,821 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:20:05,824 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:20:05,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:20:05,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:20:05,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:05,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:05,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:20:05,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:05,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668949936] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:05,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:05,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 16:20:05,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885240695] [2025-01-09 16:20:05,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:05,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:20:05,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:05,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:20:05,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:20:05,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:20:05,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:20:05,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:05,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:20:05,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:06,000 INFO L124 PetriNetUnfolderBase]: 151/277 cut-off events. [2025-01-09 16:20:06,000 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:20:06,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 277 events. 151/277 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 798 event pairs, 20 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 569. Up to 91 conditions per place. [2025-01-09 16:20:06,002 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 38 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-01-09 16:20:06,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 212 flow [2025-01-09 16:20:06,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:20:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:20:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-01-09 16:20:06,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2025-01-09 16:20:06,003 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 66 flow. Second operand 6 states and 118 transitions. [2025-01-09 16:20:06,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 212 flow [2025-01-09 16:20:06,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:20:06,004 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 100 flow [2025-01-09 16:20:06,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-01-09 16:20:06,005 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-01-09 16:20:06,005 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 100 flow [2025-01-09 16:20:06,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:20:06,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:06,005 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:06,012 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:20:06,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:06,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:20:06,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:06,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1613509982, now seen corresponding path program 2 times [2025-01-09 16:20:06,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:06,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779459581] [2025-01-09 16:20:06,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:20:06,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:06,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-09 16:20:06,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:20:06,238 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:20:06,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:06,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:06,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779459581] [2025-01-09 16:20:06,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779459581] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:06,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127358590] [2025-01-09 16:20:06,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:20:06,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:06,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:06,345 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:20:06,346 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:20:06,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-09 16:20:06,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:20:06,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:20:06,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:06,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:20:06,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:06,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:06,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127358590] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:06,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:06,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 16:20:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310578262] [2025-01-09 16:20:06,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:06,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:20:06,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:06,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:20:06,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:20:06,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:20:06,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 100 flow. Second operand has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 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:20:06,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:06,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:20:06,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:06,633 INFO L124 PetriNetUnfolderBase]: 259/439 cut-off events. [2025-01-09 16:20:06,634 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2025-01-09 16:20:06,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 439 events. 259/439 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1196 event pairs, 20 based on Foata normal form. 54/479 useless extension candidates. Maximal degree in co-relation 1091. Up to 109 conditions per place. [2025-01-09 16:20:06,641 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 74 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2025-01-09 16:20:06,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 95 transitions, 426 flow [2025-01-09 16:20:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:20:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:20:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2025-01-09 16:20:06,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6752873563218391 [2025-01-09 16:20:06,644 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 100 flow. Second operand 12 states and 235 transitions. [2025-01-09 16:20:06,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 95 transitions, 426 flow [2025-01-09 16:20:06,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 95 transitions, 412 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:20:06,649 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 170 flow [2025-01-09 16:20:06,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=170, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2025-01-09 16:20:06,650 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2025-01-09 16:20:06,650 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 170 flow [2025-01-09 16:20:06,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 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:20:06,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:06,651 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:06,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:20:06,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:06,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:20:06,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1271708734, now seen corresponding path program 3 times [2025-01-09 16:20:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:06,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732734828] [2025-01-09 16:20:06,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:20:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:06,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-01-09 16:20:06,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:20:06,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:20:06,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:07,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:07,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732734828] [2025-01-09 16:20:07,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732734828] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:07,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210760876] [2025-01-09 16:20:07,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:20:07,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:07,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:07,140 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:20:07,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:20:07,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-01-09 16:20:07,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:20:07,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:20:07,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:07,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 16:20:07,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:07,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:07,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210760876] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:07,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:07,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-09 16:20:07,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311802368] [2025-01-09 16:20:07,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:07,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 16:20:07,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:07,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 16:20:07,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:20:07,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:20:07,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 170 flow. Second operand has 25 states, 25 states have (on average 13.28) internal successors, (332), 25 states have internal predecessors, (332), 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:20:07,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:07,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:20:07,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:07,769 INFO L124 PetriNetUnfolderBase]: 475/763 cut-off events. [2025-01-09 16:20:07,769 INFO L125 PetriNetUnfolderBase]: For 4203/4203 co-relation queries the response was YES. [2025-01-09 16:20:07,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2242 conditions, 763 events. 475/763 cut-off events. For 4203/4203 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1995 event pairs, 20 based on Foata normal form. 108/857 useless extension candidates. Maximal degree in co-relation 2216. Up to 190 conditions per place. [2025-01-09 16:20:07,778 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 146 selfloop transitions, 23 changer transitions 0/179 dead transitions. [2025-01-09 16:20:07,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 179 transitions, 868 flow [2025-01-09 16:20:07,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 16:20:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-09 16:20:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 469 transitions. [2025-01-09 16:20:07,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6738505747126436 [2025-01-09 16:20:07,784 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 170 flow. Second operand 24 states and 469 transitions. [2025-01-09 16:20:07,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 179 transitions, 868 flow [2025-01-09 16:20:07,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 179 transitions, 796 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-01-09 16:20:07,797 INFO L231 Difference]: Finished difference. Result has 83 places, 47 transitions, 290 flow [2025-01-09 16:20:07,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=290, PETRI_PLACES=83, PETRI_TRANSITIONS=47} [2025-01-09 16:20:07,798 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2025-01-09 16:20:07,798 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 47 transitions, 290 flow [2025-01-09 16:20:07,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 13.28) internal successors, (332), 25 states have internal predecessors, (332), 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:20:07,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:07,799 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:07,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:20:08,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:08,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:20:08,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1886268930, now seen corresponding path program 4 times [2025-01-09 16:20:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:08,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-01-09 16:20:08,004 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:20:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:08,011 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-01-09 16:20:08,025 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 16:20:08,025 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:20:08,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:08,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653311858] [2025-01-09 16:20:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653311858] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23624267] [2025-01-09 16:20:08,385 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:20:08,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:08,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:08,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:20:08,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:20:08,428 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-01-09 16:20:08,453 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 16:20:08,453 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:20:08,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:08,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 16:20:08,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:08,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:08,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23624267] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:08,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:08,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 26 [2025-01-09 16:20:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488748842] [2025-01-09 16:20:08,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:08,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:20:08,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:08,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:20:08,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:20:08,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:20:08,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 47 transitions, 290 flow. Second operand has 26 states, 26 states have (on average 13.26923076923077) internal successors, (345), 26 states have internal predecessors, (345), 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:20:08,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:08,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:20:08,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:09,021 INFO L124 PetriNetUnfolderBase]: 511/817 cut-off events. [2025-01-09 16:20:09,021 INFO L125 PetriNetUnfolderBase]: For 5553/5553 co-relation queries the response was YES. [2025-01-09 16:20:09,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 817 events. 511/817 cut-off events. For 5553/5553 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2126 event pairs, 20 based on Foata normal form. 18/821 useless extension candidates. Maximal degree in co-relation 2486. Up to 172 conditions per place. [2025-01-09 16:20:09,027 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 158 selfloop transitions, 25 changer transitions 0/193 dead transitions. [2025-01-09 16:20:09,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 193 transitions, 960 flow [2025-01-09 16:20:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 16:20:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-09 16:20:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 497 transitions. [2025-01-09 16:20:09,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6591511936339522 [2025-01-09 16:20:09,029 INFO L175 Difference]: Start difference. First operand has 83 places, 47 transitions, 290 flow. Second operand 26 states and 497 transitions. [2025-01-09 16:20:09,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 193 transitions, 960 flow [2025-01-09 16:20:09,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 193 transitions, 860 flow, removed 39 selfloop flow, removed 11 redundant places. [2025-01-09 16:20:09,045 INFO L231 Difference]: Finished difference. Result has 99 places, 49 transitions, 266 flow [2025-01-09 16:20:09,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=266, PETRI_PLACES=99, PETRI_TRANSITIONS=49} [2025-01-09 16:20:09,049 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2025-01-09 16:20:09,049 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 49 transitions, 266 flow [2025-01-09 16:20:09,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.26923076923077) internal successors, (345), 26 states have internal predecessors, (345), 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:20:09,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:09,049 INFO L206 CegarLoopForPetriNet]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:09,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:20:09,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:09,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:20:09,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 259746206, now seen corresponding path program 5 times [2025-01-09 16:20:09,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:09,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361650188] [2025-01-09 16:20:09,255 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:20:09,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:09,263 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 13 equivalence classes. [2025-01-09 16:20:09,365 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:20:09,366 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-01-09 16:20:09,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:11,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:11,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361650188] [2025-01-09 16:20:11,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361650188] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:11,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592195896] [2025-01-09 16:20:11,193 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:20:11,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:11,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:11,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:20:11,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:20:11,231 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 13 equivalence classes. [2025-01-09 16:20:11,261 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:20:11,261 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-01-09 16:20:11,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:11,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-01-09 16:20:11,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 253 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:12,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:14,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592195896] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:14,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:14,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 90 [2025-01-09 16:20:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557559341] [2025-01-09 16:20:14,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:14,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-01-09 16:20:14,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:14,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-01-09 16:20:14,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1165, Invalid=7025, Unknown=0, NotChecked=0, Total=8190 [2025-01-09 16:20:14,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-01-09 16:20:14,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 49 transitions, 266 flow. Second operand has 91 states, 91 states have (on average 6.186813186813187) internal successors, (563), 91 states have internal predecessors, (563), 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:20:14,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:14,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-01-09 16:20:14,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand