./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.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 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:00:01,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:00:01,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:00:01,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:00:01,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:00:01,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:00:01,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:00:01,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:00:01,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:00:01,578 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:00:01,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:00:01,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:00:01,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:00:01,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:00:01,579 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:00:01,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:00:01,580 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:00:01,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:00:01,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:00:01,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:00:01,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:00:01,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:00:01,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:00:01,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:00:01,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:00:01,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:00:01,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:00:01,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:00:01,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:00:01,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:00:01,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:00:01,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:00:01,584 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 -> 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 [2025-02-08 01:00:01,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:00:01,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:00:01,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:00:01,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:00:01,900 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:00:01,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2025-02-08 01:00:03,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b08f157ec/0e8b6493453d4112a1cc6066384bd9a5/FLAG1be9a3c46 [2025-02-08 01:00:03,607 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:00:03,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2025-02-08 01:00:03,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b08f157ec/0e8b6493453d4112a1cc6066384bd9a5/FLAG1be9a3c46 [2025-02-08 01:00:03,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b08f157ec/0e8b6493453d4112a1cc6066384bd9a5 [2025-02-08 01:00:03,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:00:03,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:00:03,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:00:03,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:00:03,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:00:03,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:00:03" (1/1) ... [2025-02-08 01:00:03,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387d3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:03, skipping insertion in model container [2025-02-08 01:00:03,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:00:03" (1/1) ... [2025-02-08 01:00:03,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:00:03,818 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-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2025-02-08 01:00:03,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:00:03,991 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:00:03,999 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-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2025-02-08 01:00:04,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:00:04,087 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:00:04,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04 WrapperNode [2025-02-08 01:00:04,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:00:04,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:00:04,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:00:04,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:00:04,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,130 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2025-02-08 01:00:04,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:00:04,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:00:04,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:00:04,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:00:04,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,155 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 01:00:04,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,161 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:00:04,170 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:00:04,170 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:00:04,170 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:00:04,171 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (1/1) ... [2025-02-08 01:00:04,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:00:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:00:04,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:00:04,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:00:04,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 01:00:04,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:00:04,238 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 01:00:04,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 01:00:04,238 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 01:00:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 01:00:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 01:00:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 01:00:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:00:04,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 01:00:04,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:00:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:00:04,241 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:00:04,362 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:00:04,364 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:00:04,653 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:00:04,654 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:00:04,891 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:00:04,892 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:00:04,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:00:04 BoogieIcfgContainer [2025-02-08 01:00:04,892 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:00:04,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:00:04,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:00:04,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:00:04,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:00:03" (1/3) ... [2025-02-08 01:00:04,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625550ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:00:04, skipping insertion in model container [2025-02-08 01:00:04,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:00:04" (2/3) ... [2025-02-08 01:00:04,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625550ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:00:04, skipping insertion in model container [2025-02-08 01:00:04,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:00:04" (3/3) ... [2025-02-08 01:00:04,905 INFO L128 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2025-02-08 01:00:04,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:00:04,926 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix024_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-08 01:00:04,926 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:00:04,991 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 01:00:05,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 96 flow [2025-02-08 01:00:05,067 INFO L124 PetriNetUnfolderBase]: 1/39 cut-off events. [2025-02-08 01:00:05,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:00:05,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 1/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-02-08 01:00:05,076 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 42 transitions, 96 flow [2025-02-08 01:00:05,079 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 39 transitions, 87 flow [2025-02-08 01:00:05,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:00:05,108 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;@35c0c9ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:00:05,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 01:00:05,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:00:05,115 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-08 01:00:05,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:00:05,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:00:05,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 01:00:05,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:00:05,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:00:05,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2071178303, now seen corresponding path program 1 times [2025-02-08 01:00:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:00:05,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181943169] [2025-02-08 01:00:05,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:00:05,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:00:05,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 01:00:05,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 01:00:05,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:00:05,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:00:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:00:05,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:00:05,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181943169] [2025-02-08 01:00:05,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181943169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:00:05,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:00:05,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 01:00:05,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960034896] [2025-02-08 01:00:05,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:00:05,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 01:00:05,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:00:05,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 01:00:05,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 01:00:05,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-02-08 01:00:05,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 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-02-08 01:00:05,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:00:05,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-02-08 01:00:05,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:00:07,235 INFO L124 PetriNetUnfolderBase]: 6739/9666 cut-off events. [2025-02-08 01:00:07,236 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-08 01:00:07,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19325 conditions, 9666 events. 6739/9666 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 53858 event pairs, 749 based on Foata normal form. 328/9939 useless extension candidates. Maximal degree in co-relation 19314. Up to 8311 conditions per place. [2025-02-08 01:00:07,305 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 49 selfloop transitions, 2 changer transitions 2/59 dead transitions. [2025-02-08 01:00:07,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 236 flow [2025-02-08 01:00:07,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 01:00:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 01:00:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-02-08 01:00:07,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2025-02-08 01:00:07,321 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 83 transitions. [2025-02-08 01:00:07,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 236 flow [2025-02-08 01:00:07,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 01:00:07,329 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-02-08 01:00:07,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-08 01:00:07,334 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-02-08 01:00:07,335 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-02-08 01:00:07,336 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-02-08 01:00:07,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:00:07,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:00:07,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:00:07,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:00:07,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:00:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1076973787, now seen corresponding path program 1 times [2025-02-08 01:00:07,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:00:07,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280669039] [2025-02-08 01:00:07,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:00:07,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:00:07,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:00:07,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:00:07,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:00:07,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:00:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:00:07,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:00:07,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280669039] [2025-02-08 01:00:07,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280669039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:00:07,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:00:07,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:00:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202654062] [2025-02-08 01:00:07,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:00:07,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:00:07,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:00:07,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:00:07,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:00:07,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-02-08 01:00:07,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:07,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:00:07,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-02-08 01:00:07,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:00:10,208 INFO L124 PetriNetUnfolderBase]: 15579/22563 cut-off events. [2025-02-08 01:00:10,208 INFO L125 PetriNetUnfolderBase]: For 676/676 co-relation queries the response was YES. [2025-02-08 01:00:10,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45633 conditions, 22563 events. 15579/22563 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 139994 event pairs, 3532 based on Foata normal form. 0/22024 useless extension candidates. Maximal degree in co-relation 45623. Up to 9687 conditions per place. [2025-02-08 01:00:10,319 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 52 selfloop transitions, 7 changer transitions 113/176 dead transitions. [2025-02-08 01:00:10,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 176 transitions, 722 flow [2025-02-08 01:00:10,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:00:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 01:00:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2025-02-08 01:00:10,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2025-02-08 01:00:10,326 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 9 states and 237 transitions. [2025-02-08 01:00:10,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 176 transitions, 722 flow [2025-02-08 01:00:10,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 176 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:00:10,334 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 174 flow [2025-02-08 01:00:10,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=174, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2025-02-08 01:00:10,336 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2025-02-08 01:00:10,336 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 174 flow [2025-02-08 01:00:10,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:10,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:00:10,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:00:10,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:00:10,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:00:10,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:00:10,338 INFO L85 PathProgramCache]: Analyzing trace with hash -47663986, now seen corresponding path program 1 times [2025-02-08 01:00:10,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:00:10,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289620040] [2025-02-08 01:00:10,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:00:10,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:00:10,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 01:00:10,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 01:00:10,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:00:10,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:00:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:00:10,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:00:10,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289620040] [2025-02-08 01:00:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289620040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:00:10,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:00:10,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:00:10,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270806459] [2025-02-08 01:00:10,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:00:10,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:00:10,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:00:10,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:00:10,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:00:10,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-02-08 01:00:10,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:10,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:00:10,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-02-08 01:00:10,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:00:12,452 INFO L124 PetriNetUnfolderBase]: 11644/17046 cut-off events. [2025-02-08 01:00:12,452 INFO L125 PetriNetUnfolderBase]: For 16823/16829 co-relation queries the response was YES. [2025-02-08 01:00:12,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47757 conditions, 17046 events. 11644/17046 cut-off events. For 16823/16829 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 101532 event pairs, 2046 based on Foata normal form. 530/17567 useless extension candidates. Maximal degree in co-relation 47739. Up to 7153 conditions per place. [2025-02-08 01:00:12,554 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 65 selfloop transitions, 7 changer transitions 100/176 dead transitions. [2025-02-08 01:00:12,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 176 transitions, 1022 flow [2025-02-08 01:00:12,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:00:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:00:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 232 transitions. [2025-02-08 01:00:12,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2025-02-08 01:00:12,557 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 174 flow. Second operand 10 states and 232 transitions. [2025-02-08 01:00:12,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 176 transitions, 1022 flow [2025-02-08 01:00:12,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 176 transitions, 908 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-02-08 01:00:12,641 INFO L231 Difference]: Finished difference. Result has 66 places, 44 transitions, 216 flow [2025-02-08 01:00:12,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=216, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2025-02-08 01:00:12,642 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2025-02-08 01:00:12,642 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 216 flow [2025-02-08 01:00:12,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:12,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:00:12,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:00:12,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:00:12,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:00:12,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:00:12,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2107822183, now seen corresponding path program 1 times [2025-02-08 01:00:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:00:12,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002684623] [2025-02-08 01:00:12,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:00:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:00:12,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 01:00:12,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 01:00:12,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:00:12,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:00:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:00:12,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:00:12,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002684623] [2025-02-08 01:00:12,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002684623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:00:12,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:00:12,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:00:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302117700] [2025-02-08 01:00:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:00:12,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:00:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:00:12,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:00:12,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:00:12,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-02-08 01:00:12,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 44 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:12,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:00:12,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-02-08 01:00:12,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:00:14,161 INFO L124 PetriNetUnfolderBase]: 9988/14690 cut-off events. [2025-02-08 01:00:14,161 INFO L125 PetriNetUnfolderBase]: For 22572/22578 co-relation queries the response was YES. [2025-02-08 01:00:14,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42562 conditions, 14690 events. 9988/14690 cut-off events. For 22572/22578 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 84287 event pairs, 4900 based on Foata normal form. 404/15085 useless extension candidates. Maximal degree in co-relation 42537. Up to 8773 conditions per place. [2025-02-08 01:00:14,253 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 58 selfloop transitions, 4 changer transitions 61/127 dead transitions. [2025-02-08 01:00:14,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 127 transitions, 816 flow [2025-02-08 01:00:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:00:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:00:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2025-02-08 01:00:14,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-02-08 01:00:14,255 INFO L175 Difference]: Start difference. First operand has 66 places, 44 transitions, 216 flow. Second operand 7 states and 154 transitions. [2025-02-08 01:00:14,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 127 transitions, 816 flow [2025-02-08 01:00:14,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 127 transitions, 781 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-02-08 01:00:14,419 INFO L231 Difference]: Finished difference. Result has 66 places, 44 transitions, 217 flow [2025-02-08 01:00:14,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=7, PETRI_FLOW=217, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2025-02-08 01:00:14,420 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2025-02-08 01:00:14,420 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 217 flow [2025-02-08 01:00:14,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:14,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:00:14,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:00:14,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:00:14,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:00:14,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:00:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash 648350939, now seen corresponding path program 1 times [2025-02-08 01:00:14,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:00:14,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008535367] [2025-02-08 01:00:14,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:00:14,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:00:14,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:00:14,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:00:14,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:00:14,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:00:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:00:14,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:00:14,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008535367] [2025-02-08 01:00:14,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008535367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:00:14,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:00:14,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:00:14,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517104849] [2025-02-08 01:00:14,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:00:14,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:00:14,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:00:14,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:00:14,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:00:14,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-02-08 01:00:14,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 44 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:14,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:00:14,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-02-08 01:00:14,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:00:15,332 INFO L124 PetriNetUnfolderBase]: 6821/10461 cut-off events. [2025-02-08 01:00:15,332 INFO L125 PetriNetUnfolderBase]: For 13468/13474 co-relation queries the response was YES. [2025-02-08 01:00:15,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29475 conditions, 10461 events. 6821/10461 cut-off events. For 13468/13474 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 61849 event pairs, 1240 based on Foata normal form. 548/11000 useless extension candidates. Maximal degree in co-relation 29448. Up to 4826 conditions per place. [2025-02-08 01:00:15,387 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 88 selfloop transitions, 5 changer transitions 1/99 dead transitions. [2025-02-08 01:00:15,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 709 flow [2025-02-08 01:00:15,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:00:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:00:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-02-08 01:00:15,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6369047619047619 [2025-02-08 01:00:15,388 INFO L175 Difference]: Start difference. First operand has 66 places, 44 transitions, 217 flow. Second operand 4 states and 107 transitions. [2025-02-08 01:00:15,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 709 flow [2025-02-08 01:00:15,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 651 flow, removed 19 selfloop flow, removed 10 redundant places. [2025-02-08 01:00:15,412 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 225 flow [2025-02-08 01:00:15,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=4, PETRI_FLOW=225, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-02-08 01:00:15,413 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2025-02-08 01:00:15,413 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 225 flow [2025-02-08 01:00:15,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:15,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:00:15,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:00:15,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:00:15,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:00:15,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:00:15,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1151199800, now seen corresponding path program 1 times [2025-02-08 01:00:15,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:00:15,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213243965] [2025-02-08 01:00:15,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:00:15,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:00:15,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 01:00:15,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 01:00:15,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:00:15,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:00:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:00:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:00:15,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213243965] [2025-02-08 01:00:15,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213243965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:00:15,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:00:15,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:00:15,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928427424] [2025-02-08 01:00:15,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:00:15,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:00:15,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:00:15,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:00:15,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:00:15,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-02-08 01:00:15,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:15,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:00:15,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-02-08 01:00:15,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:00:16,207 INFO L124 PetriNetUnfolderBase]: 4174/6430 cut-off events. [2025-02-08 01:00:16,208 INFO L125 PetriNetUnfolderBase]: For 7307/7313 co-relation queries the response was YES. [2025-02-08 01:00:16,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19244 conditions, 6430 events. 4174/6430 cut-off events. For 7307/7313 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 34546 event pairs, 756 based on Foata normal form. 374/6795 useless extension candidates. Maximal degree in co-relation 19223. Up to 2419 conditions per place. [2025-02-08 01:00:16,235 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 107 selfloop transitions, 8 changer transitions 2/122 dead transitions. [2025-02-08 01:00:16,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 122 transitions, 841 flow [2025-02-08 01:00:16,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:00:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 01:00:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2025-02-08 01:00:16,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2025-02-08 01:00:16,236 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 225 flow. Second operand 5 states and 137 transitions. [2025-02-08 01:00:16,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 122 transitions, 841 flow [2025-02-08 01:00:16,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 122 transitions, 831 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 01:00:16,247 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 265 flow [2025-02-08 01:00:16,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2025-02-08 01:00:16,249 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2025-02-08 01:00:16,249 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 265 flow [2025-02-08 01:00:16,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:16,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:00:16,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:00:16,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:00:16,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:00:16,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:00:16,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1555030193, now seen corresponding path program 1 times [2025-02-08 01:00:16,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:00:16,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849227151] [2025-02-08 01:00:16,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:00:16,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:00:16,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:00:16,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:00:16,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:00:16,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:00:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:00:16,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:00:16,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849227151] [2025-02-08 01:00:16,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849227151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:00:16,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:00:16,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:00:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16295309] [2025-02-08 01:00:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:00:16,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:00:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:00:16,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:00:16,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:00:16,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-02-08 01:00:16,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 265 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:16,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:00:16,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-02-08 01:00:16,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:00:17,545 INFO L124 PetriNetUnfolderBase]: 5447/8356 cut-off events. [2025-02-08 01:00:17,545 INFO L125 PetriNetUnfolderBase]: For 10283/10283 co-relation queries the response was YES. [2025-02-08 01:00:17,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25753 conditions, 8356 events. 5447/8356 cut-off events. For 10283/10283 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 46452 event pairs, 1343 based on Foata normal form. 60/8412 useless extension candidates. Maximal degree in co-relation 25730. Up to 4842 conditions per place. [2025-02-08 01:00:17,588 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 75 selfloop transitions, 2 changer transitions 48/129 dead transitions. [2025-02-08 01:00:17,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 129 transitions, 901 flow [2025-02-08 01:00:17,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:00:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:00:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2025-02-08 01:00:17,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515873015873016 [2025-02-08 01:00:17,590 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 265 flow. Second operand 6 states and 139 transitions. [2025-02-08 01:00:17,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 129 transitions, 901 flow [2025-02-08 01:00:17,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 129 transitions, 844 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-02-08 01:00:17,613 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 268 flow [2025-02-08 01:00:17,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2025-02-08 01:00:17,614 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2025-02-08 01:00:17,614 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 268 flow [2025-02-08 01:00:17,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:17,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:00:17,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:00:17,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:00:17,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:00:17,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:00:17,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1316060223, now seen corresponding path program 2 times [2025-02-08 01:00:17,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:00:17,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128551063] [2025-02-08 01:00:17,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:00:17,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:00:17,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-02-08 01:00:17,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 01:00:17,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:00:17,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:00:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:00:17,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:00:17,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128551063] [2025-02-08 01:00:17,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128551063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:00:17,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:00:17,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:00:17,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563196569] [2025-02-08 01:00:17,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:00:17,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:00:17,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:00:17,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:00:17,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:00:17,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2025-02-08 01:00:17,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:17,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:00:17,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2025-02-08 01:00:17,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:00:18,627 INFO L124 PetriNetUnfolderBase]: 4039/6209 cut-off events. [2025-02-08 01:00:18,627 INFO L125 PetriNetUnfolderBase]: For 7432/7438 co-relation queries the response was YES. [2025-02-08 01:00:18,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18436 conditions, 6209 events. 4039/6209 cut-off events. For 7432/7438 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 33590 event pairs, 849 based on Foata normal form. 224/6424 useless extension candidates. Maximal degree in co-relation 18411. Up to 2350 conditions per place. [2025-02-08 01:00:18,647 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 70 selfloop transitions, 11 changer transitions 21/107 dead transitions. [2025-02-08 01:00:18,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 754 flow [2025-02-08 01:00:18,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:00:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:00:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-02-08 01:00:18,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-02-08 01:00:18,648 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 268 flow. Second operand 6 states and 135 transitions. [2025-02-08 01:00:18,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 754 flow [2025-02-08 01:00:18,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 107 transitions, 723 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-02-08 01:00:18,662 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 252 flow [2025-02-08 01:00:18,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2025-02-08 01:00:18,663 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2025-02-08 01:00:18,663 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 252 flow [2025-02-08 01:00:18,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:18,663 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:00:18,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:00:18,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:00:18,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:00:18,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:00:18,665 INFO L85 PathProgramCache]: Analyzing trace with hash -517217543, now seen corresponding path program 1 times [2025-02-08 01:00:18,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:00:18,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585577459] [2025-02-08 01:00:18,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:00:18,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:00:18,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 01:00:18,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:00:18,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:00:18,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:00:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:00:20,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:00:20,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585577459] [2025-02-08 01:00:20,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585577459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:00:20,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:00:20,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:00:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410008000] [2025-02-08 01:00:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:00:20,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:00:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:00:20,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:00:20,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:00:20,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-02-08 01:00:20,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 252 flow. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:20,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:00:20,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-02-08 01:00:20,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:00:20,971 INFO L124 PetriNetUnfolderBase]: 3160/4963 cut-off events. [2025-02-08 01:00:20,971 INFO L125 PetriNetUnfolderBase]: For 7848/7848 co-relation queries the response was YES. [2025-02-08 01:00:20,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15388 conditions, 4963 events. 3160/4963 cut-off events. For 7848/7848 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 26843 event pairs, 592 based on Foata normal form. 8/4965 useless extension candidates. Maximal degree in co-relation 15364. Up to 2055 conditions per place. [2025-02-08 01:00:20,995 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 61 selfloop transitions, 5 changer transitions 73/143 dead transitions. [2025-02-08 01:00:20,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 143 transitions, 1066 flow [2025-02-08 01:00:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:00:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:00:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2025-02-08 01:00:20,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-02-08 01:00:20,997 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 252 flow. Second operand 8 states and 160 transitions. [2025-02-08 01:00:20,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 143 transitions, 1066 flow [2025-02-08 01:00:21,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 143 transitions, 794 flow, removed 64 selfloop flow, removed 12 redundant places. [2025-02-08 01:00:21,039 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 219 flow [2025-02-08 01:00:21,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=219, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-02-08 01:00:21,040 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2025-02-08 01:00:21,040 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 219 flow [2025-02-08 01:00:21,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:21,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:00:21,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:00:21,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:00:21,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:00:21,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:00:21,041 INFO L85 PathProgramCache]: Analyzing trace with hash -777738421, now seen corresponding path program 2 times [2025-02-08 01:00:21,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:00:21,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473462562] [2025-02-08 01:00:21,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:00:21,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:00:21,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-02-08 01:00:21,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:00:21,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:00:21,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:00:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:00:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:00:21,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473462562] [2025-02-08 01:00:21,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473462562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:00:21,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:00:21,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:00:21,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896414998] [2025-02-08 01:00:21,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:00:21,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:00:21,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:00:21,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:00:21,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:00:21,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2025-02-08 01:00:21,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:21,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:00:21,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2025-02-08 01:00:21,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:00:21,634 INFO L124 PetriNetUnfolderBase]: 2373/3791 cut-off events. [2025-02-08 01:00:21,634 INFO L125 PetriNetUnfolderBase]: For 2426/2426 co-relation queries the response was YES. [2025-02-08 01:00:21,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10346 conditions, 3791 events. 2373/3791 cut-off events. For 2426/2426 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19904 event pairs, 821 based on Foata normal form. 8/3790 useless extension candidates. Maximal degree in co-relation 10325. Up to 2056 conditions per place. [2025-02-08 01:00:21,648 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 40 selfloop transitions, 3 changer transitions 44/91 dead transitions. [2025-02-08 01:00:21,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 91 transitions, 535 flow [2025-02-08 01:00:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:00:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:00:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-02-08 01:00:21,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2025-02-08 01:00:21,650 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 219 flow. Second operand 6 states and 109 transitions. [2025-02-08 01:00:21,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 91 transitions, 535 flow [2025-02-08 01:00:21,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 510 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 01:00:21,656 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 164 flow [2025-02-08 01:00:21,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2025-02-08 01:00:21,657 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2025-02-08 01:00:21,657 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 164 flow [2025-02-08 01:00:21,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:00:21,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:00:21,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:00:21,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:00:21,658 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-08 01:00:21,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:00:21,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1428230379, now seen corresponding path program 3 times [2025-02-08 01:00:21,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:00:21,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746493345] [2025-02-08 01:00:21,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:00:21,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:00:21,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 1 equivalence classes. [2025-02-08 01:00:21,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:00:21,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:00:21,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:00:21,739 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 01:00:21,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 01:00:21,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 01:00:21,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:00:21,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:00:21,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 01:00:21,831 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 01:00:21,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-02-08 01:00:21,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-08 01:00:21,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-08 01:00:21,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-08 01:00:21,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-08 01:00:21,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-08 01:00:21,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 01:00:21,835 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 01:00:21,915 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:00:21,915 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:00:21,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:00:21 BasicIcfg [2025-02-08 01:00:21,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:00:21,925 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:00:21,925 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:00:21,926 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:00:21,927 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:00:04" (3/4) ... [2025-02-08 01:00:21,927 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 01:00:22,023 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-08 01:00:22,068 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:00:22,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:00:22,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:00:22,070 INFO L158 Benchmark]: Toolchain (without parser) took 18427.97ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 111.9MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 575.0MB. Max. memory is 16.1GB. [2025-02-08 01:00:22,070 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:00:22,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.82ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 88.8MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:00:22,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.34ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 86.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:00:22,071 INFO L158 Benchmark]: Boogie Preprocessor took 38.25ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 83.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:00:22,071 INFO L158 Benchmark]: IcfgBuilder took 723.79ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 100.7MB in the end (delta: -16.9MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2025-02-08 01:00:22,072 INFO L158 Benchmark]: TraceAbstraction took 17029.04ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 99.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 535.6MB. Max. memory is 16.1GB. [2025-02-08 01:00:22,072 INFO L158 Benchmark]: Witness Printer took 143.38ms. Allocated memory is still 2.3GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:00:22,074 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.35ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.82ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 88.8MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.34ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 86.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.25ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 83.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 723.79ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 100.7MB in the end (delta: -16.9MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17029.04ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 99.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 535.6MB. Max. memory is 16.1GB. * Witness Printer took 143.38ms. Allocated memory is still 2.3GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t636; [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t636=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t637; [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636=-2, t637=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t638; [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636=-2, t637=-1, t638=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 2 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L756] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636=-2, t637=-1, t638=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636=-2, t637=-1, t638=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636=-2, t637=-1, t638=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: 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. - UnprovableResult [Line: 849]: 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: 847]: 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: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 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: 16.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 721 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2181 IncrementalHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 8 mSDtfsCounter, 2181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=7, InterpolantAutomatonStates: 64, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 01:00:22,096 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