./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:33:55,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:33:55,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:33:55,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:33:55,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:33:55,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:33:55,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:33:55,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:33:55,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:33:55,815 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:33:55,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:33:55,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:33:55,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:33:55,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:33:55,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:33:55,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:33:55,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:33:55,817 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/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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 [2025-03-13 21:33:56,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:33:56,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:33:56,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:33:56,070 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:33:56,070 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:33:56,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2025-03-13 21:33:57,190 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5682332/52142bf83d09432184a1252f053629a7/FLAGe0991cac4 [2025-03-13 21:33:57,476 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:33:57,477 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2025-03-13 21:33:57,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5682332/52142bf83d09432184a1252f053629a7/FLAGe0991cac4 [2025-03-13 21:33:57,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad5682332/52142bf83d09432184a1252f053629a7 [2025-03-13 21:33:57,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:33:57,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:33:57,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:33:57,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:33:57,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:33:57,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:33:57" (1/1) ... [2025-03-13 21:33:57,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e386d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:57, skipping insertion in model container [2025-03-13 21:33:57,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:33:57" (1/1) ... [2025-03-13 21:33:57,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:33:57,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2025-03-13 21:33:58,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:33:58,141 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:33:58,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2025-03-13 21:33:58,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:33:58,213 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:33:58,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58 WrapperNode [2025-03-13 21:33:58,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:33:58,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:33:58,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:33:58,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:33:58,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,252 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2025-03-13 21:33:58,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:33:58,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:33:58,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:33:58,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:33:58,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,284 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-03-13 21:33:58,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,290 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:33:58,298 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:33:58,300 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:33:58,300 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:33:58,301 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (1/1) ... [2025-03-13 21:33:58,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:33:58,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:33:58,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:33:58,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:33:58,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:33:58,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:33:58,350 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-13 21:33:58,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-13 21:33:58,350 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-13 21:33:58,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-13 21:33:58,350 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-13 21:33:58,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-13 21:33:58,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:33:58,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:33:58,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:33:58,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:33:58,352 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:33:58,465 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:33:58,466 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:33:58,766 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:33:58,767 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:33:58,767 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:33:58,984 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:33:58,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:33:58 BoogieIcfgContainer [2025-03-13 21:33:58,985 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:33:58,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:33:58,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:33:58,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:33:58,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:33:57" (1/3) ... [2025-03-13 21:33:58,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fede3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:33:58, skipping insertion in model container [2025-03-13 21:33:58,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:33:58" (2/3) ... [2025-03-13 21:33:58,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18fede3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:33:58, skipping insertion in model container [2025-03-13 21:33:58,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:33:58" (3/3) ... [2025-03-13 21:33:58,994 INFO L128 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2025-03-13 21:33:59,004 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:33:59,005 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe004_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-13 21:33:59,006 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:33:59,049 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:33:59,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2025-03-13 21:33:59,105 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-03-13 21:33:59,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:33:59,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-03-13 21:33:59,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2025-03-13 21:33:59,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2025-03-13 21:33:59,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:33:59,134 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;@4bcc1fd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:33:59,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-13 21:33:59,142 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:33:59,143 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-13 21:33:59,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:33:59,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:33:59,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-13 21:33:59,145 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-03-13 21:33:59,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:33:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1830633885, now seen corresponding path program 1 times [2025-03-13 21:33:59,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:33:59,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238234439] [2025-03-13 21:33:59,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:33:59,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:33:59,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-13 21:33:59,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-13 21:33:59,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:33:59,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:33:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:33:59,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:33:59,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238234439] [2025-03-13 21:33:59,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238234439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:33:59,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:33:59,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:33:59,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6650733] [2025-03-13 21:33:59,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:33:59,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:33:59,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:33:59,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:33:59,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:33:59,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-13 21:33:59,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 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-03-13 21:33:59,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:33:59,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-13 21:33:59,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:00,359 INFO L124 PetriNetUnfolderBase]: 4235/6144 cut-off events. [2025-03-13 21:34:00,359 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-13 21:34:00,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12283 conditions, 6144 events. 4235/6144 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 33562 event pairs, 465 based on Foata normal form. 210/6313 useless extension candidates. Maximal degree in co-relation 12272. Up to 5271 conditions per place. [2025-03-13 21:34:00,405 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 43 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2025-03-13 21:34:00,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 212 flow [2025-03-13 21:34:00,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:34:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:34:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-13 21:34:00,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6581196581196581 [2025-03-13 21:34:00,418 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 77 transitions. [2025-03-13 21:34:00,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 212 flow [2025-03-13 21:34:00,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 208 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:34:00,428 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2025-03-13 21:34:00,430 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-03-13 21:34:00,433 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2025-03-13 21:34:00,433 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2025-03-13 21:34:00,434 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-03-13 21:34:00,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:00,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:34:00,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:34:00,434 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-03-13 21:34:00,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash -792226052, now seen corresponding path program 1 times [2025-03-13 21:34:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:00,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153214852] [2025-03-13 21:34:00,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:00,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:00,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:34:00,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:34:00,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:00,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:34:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:00,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153214852] [2025-03-13 21:34:00,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153214852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:34:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274850536] [2025-03-13 21:34:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:00,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:34:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:00,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:34:00,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:34:00,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-13 21:34:00,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-03-13 21:34:00,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:00,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-13 21:34:00,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:01,163 INFO L124 PetriNetUnfolderBase]: 3123/5081 cut-off events. [2025-03-13 21:34:01,164 INFO L125 PetriNetUnfolderBase]: For 220/220 co-relation queries the response was YES. [2025-03-13 21:34:01,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10007 conditions, 5081 events. 3123/5081 cut-off events. For 220/220 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 30376 event pairs, 535 based on Foata normal form. 216/5133 useless extension candidates. Maximal degree in co-relation 9997. Up to 2501 conditions per place. [2025-03-13 21:34:01,181 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 54 selfloop transitions, 5 changer transitions 1/66 dead transitions. [2025-03-13 21:34:01,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 270 flow [2025-03-13 21:34:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:34:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:34:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-03-13 21:34:01,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2025-03-13 21:34:01,184 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 4 states and 98 transitions. [2025-03-13 21:34:01,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 270 flow [2025-03-13 21:34:01,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:34:01,189 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2025-03-13 21:34:01,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-03-13 21:34:01,190 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2025-03-13 21:34:01,190 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2025-03-13 21:34:01,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-03-13 21:34:01,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:01,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:34:01,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:34:01,191 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-03-13 21:34:01,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:01,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1892747653, now seen corresponding path program 1 times [2025-03-13 21:34:01,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:01,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905394184] [2025-03-13 21:34:01,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:01,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:01,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:34:01,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:34:01,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:01,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:34:01,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905394184] [2025-03-13 21:34:01,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905394184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:01,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:01,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:34:01,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244137554] [2025-03-13 21:34:01,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:01,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:34:01,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:01,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:34:01,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:34:01,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-13 21:34:01,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-03-13 21:34:01,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:01,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-13 21:34:01,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:01,741 INFO L124 PetriNetUnfolderBase]: 1827/2953 cut-off events. [2025-03-13 21:34:01,741 INFO L125 PetriNetUnfolderBase]: For 592/592 co-relation queries the response was YES. [2025-03-13 21:34:01,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6713 conditions, 2953 events. 1827/2953 cut-off events. For 592/592 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 15120 event pairs, 339 based on Foata normal form. 152/3037 useless extension candidates. Maximal degree in co-relation 6701. Up to 960 conditions per place. [2025-03-13 21:34:01,754 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 69 selfloop transitions, 8 changer transitions 1/84 dead transitions. [2025-03-13 21:34:01,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 379 flow [2025-03-13 21:34:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:34:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:34:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-13 21:34:01,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6410256410256411 [2025-03-13 21:34:01,756 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 106 flow. Second operand 5 states and 125 transitions. [2025-03-13 21:34:01,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 379 flow [2025-03-13 21:34:01,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 369 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 21:34:01,759 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 146 flow [2025-03-13 21:34:01,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-03-13 21:34:01,759 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2025-03-13 21:34:01,760 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 146 flow [2025-03-13 21:34:01,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-03-13 21:34:01,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:01,760 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-03-13 21:34:01,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:34:01,760 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-03-13 21:34:01,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:01,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1525663444, now seen corresponding path program 1 times [2025-03-13 21:34:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:01,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206145536] [2025-03-13 21:34:01,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:01,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:34:01,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:34:01,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:01,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:34:02,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:02,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206145536] [2025-03-13 21:34:02,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206145536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:02,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:02,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:34:02,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749073460] [2025-03-13 21:34:02,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:02,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:34:02,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:02,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:34:02,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:34:02,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2025-03-13 21:34:02,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-03-13 21:34:02,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:02,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2025-03-13 21:34:02,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:02,302 INFO L124 PetriNetUnfolderBase]: 1155/1801 cut-off events. [2025-03-13 21:34:02,302 INFO L125 PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES. [2025-03-13 21:34:02,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4525 conditions, 1801 events. 1155/1801 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7953 event pairs, 303 based on Foata normal form. 56/1837 useless extension candidates. Maximal degree in co-relation 4511. Up to 672 conditions per place. [2025-03-13 21:34:02,312 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 58 selfloop transitions, 11 changer transitions 1/76 dead transitions. [2025-03-13 21:34:02,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 370 flow [2025-03-13 21:34:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:34:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:34:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-03-13 21:34:02,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-13 21:34:02,315 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 146 flow. Second operand 6 states and 126 transitions. [2025-03-13 21:34:02,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 370 flow [2025-03-13 21:34:02,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 345 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-13 21:34:02,325 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 160 flow [2025-03-13 21:34:02,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2025-03-13 21:34:02,327 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2025-03-13 21:34:02,327 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 160 flow [2025-03-13 21:34:02,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-03-13 21:34:02,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:02,328 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] [2025-03-13 21:34:02,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:34:02,328 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-03-13 21:34:02,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:02,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1602041914, now seen corresponding path program 1 times [2025-03-13 21:34:02,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:02,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658668767] [2025-03-13 21:34:02,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:34:02,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:02,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:34:02,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:34:02,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:02,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:34:02,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:02,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658668767] [2025-03-13 21:34:02,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658668767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:02,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:02,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:34:02,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483804001] [2025-03-13 21:34:02,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:02,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:34:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:02,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:34:02,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:34:02,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-13 21:34:02,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 160 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-03-13 21:34:02,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:02,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-13 21:34:02,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:03,089 INFO L124 PetriNetUnfolderBase]: 1641/2559 cut-off events. [2025-03-13 21:34:03,089 INFO L125 PetriNetUnfolderBase]: For 1880/1880 co-relation queries the response was YES. [2025-03-13 21:34:03,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6588 conditions, 2559 events. 1641/2559 cut-off events. For 1880/1880 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12289 event pairs, 743 based on Foata normal form. 8/2558 useless extension candidates. Maximal degree in co-relation 6573. Up to 1435 conditions per place. [2025-03-13 21:34:03,102 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 45 selfloop transitions, 2 changer transitions 20/72 dead transitions. [2025-03-13 21:34:03,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 434 flow [2025-03-13 21:34:03,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:34:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:34:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-03-13 21:34:03,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2025-03-13 21:34:03,104 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 160 flow. Second operand 5 states and 96 transitions. [2025-03-13 21:34:03,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 434 flow [2025-03-13 21:34:03,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 325 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-03-13 21:34:03,115 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 116 flow [2025-03-13 21:34:03,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-03-13 21:34:03,116 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2025-03-13 21:34:03,117 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 116 flow [2025-03-13 21:34:03,117 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-03-13 21:34:03,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:03,117 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] [2025-03-13 21:34:03,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:34:03,118 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-03-13 21:34:03,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash 718149988, now seen corresponding path program 2 times [2025-03-13 21:34:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:03,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334157948] [2025-03-13 21:34:03,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:34:03,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:03,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:34:03,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:34:03,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:34:03,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:34:03,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:03,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334157948] [2025-03-13 21:34:03,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334157948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:03,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:03,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:34:03,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901660188] [2025-03-13 21:34:03,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:03,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:34:03,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:03,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:34:03,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:34:03,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-13 21:34:03,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-03-13 21:34:03,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:03,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-13 21:34:03,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:03,946 INFO L124 PetriNetUnfolderBase]: 1439/2254 cut-off events. [2025-03-13 21:34:03,946 INFO L125 PetriNetUnfolderBase]: For 334/334 co-relation queries the response was YES. [2025-03-13 21:34:03,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5193 conditions, 2254 events. 1439/2254 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10114 event pairs, 289 based on Foata normal form. 8/2260 useless extension candidates. Maximal degree in co-relation 5180. Up to 990 conditions per place. [2025-03-13 21:34:03,955 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 53 selfloop transitions, 8 changer transitions 24/90 dead transitions. [2025-03-13 21:34:03,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 90 transitions, 429 flow [2025-03-13 21:34:03,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:34:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:34:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-03-13 21:34:03,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2025-03-13 21:34:03,957 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 116 flow. Second operand 7 states and 128 transitions. [2025-03-13 21:34:03,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 90 transitions, 429 flow [2025-03-13 21:34:03,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 411 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 21:34:03,959 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 163 flow [2025-03-13 21:34:03,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=163, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-03-13 21:34:03,959 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2025-03-13 21:34:03,959 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 163 flow [2025-03-13 21:34:03,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-03-13 21:34:03,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:03,960 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] [2025-03-13 21:34:03,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:34:03,960 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-03-13 21:34:03,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1243119526, now seen corresponding path program 3 times [2025-03-13 21:34:03,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:03,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700393848] [2025-03-13 21:34:03,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:34:03,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:03,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:34:04,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:34:04,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:34:04,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:34:04,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:04,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700393848] [2025-03-13 21:34:04,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700393848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:04,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:04,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:34:04,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69848196] [2025-03-13 21:34:04,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:04,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 21:34:04,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:04,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 21:34:04,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-13 21:34:04,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-13 21:34:04,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-03-13 21:34:04,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:04,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-13 21:34:04,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:04,825 INFO L124 PetriNetUnfolderBase]: 1389/2176 cut-off events. [2025-03-13 21:34:04,825 INFO L125 PetriNetUnfolderBase]: For 847/847 co-relation queries the response was YES. [2025-03-13 21:34:04,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5794 conditions, 2176 events. 1389/2176 cut-off events. For 847/847 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9605 event pairs, 95 based on Foata normal form. 8/2183 useless extension candidates. Maximal degree in co-relation 5778. Up to 960 conditions per place. [2025-03-13 21:34:04,833 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 52 selfloop transitions, 14 changer transitions 37/108 dead transitions. [2025-03-13 21:34:04,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 595 flow [2025-03-13 21:34:04,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:34:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:34:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2025-03-13 21:34:04,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2025-03-13 21:34:04,835 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 163 flow. Second operand 8 states and 146 transitions. [2025-03-13 21:34:04,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 595 flow [2025-03-13 21:34:04,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 108 transitions, 579 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-13 21:34:04,838 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 244 flow [2025-03-13 21:34:04,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2025-03-13 21:34:04,838 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2025-03-13 21:34:04,839 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 244 flow [2025-03-13 21:34:04,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-03-13 21:34:04,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:04,839 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] [2025-03-13 21:34:04,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:34:04,839 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-03-13 21:34:04,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:04,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1179648562, now seen corresponding path program 4 times [2025-03-13 21:34:04,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:04,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219005486] [2025-03-13 21:34:04,840 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:34:04,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:04,849 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-13 21:34:04,908 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:34:04,908 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:34:04,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:34:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:34:06,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:34:06,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219005486] [2025-03-13 21:34:06,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219005486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:34:06,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:34:06,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 21:34:06,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429054645] [2025-03-13 21:34:06,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:34:06,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 21:34:06,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:34:06,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 21:34:06,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:34:06,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2025-03-13 21:34:06,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 244 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-03-13 21:34:06,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:34:06,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2025-03-13 21:34:06,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:34:07,273 INFO L124 PetriNetUnfolderBase]: 1590/2583 cut-off events. [2025-03-13 21:34:07,274 INFO L125 PetriNetUnfolderBase]: For 1718/1718 co-relation queries the response was YES. [2025-03-13 21:34:07,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 2583 events. 1590/2583 cut-off events. For 1718/1718 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12488 event pairs, 470 based on Foata normal form. 16/2599 useless extension candidates. Maximal degree in co-relation 7118. Up to 678 conditions per place. [2025-03-13 21:34:07,283 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 72 selfloop transitions, 13 changer transitions 71/161 dead transitions. [2025-03-13 21:34:07,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 161 transitions, 994 flow [2025-03-13 21:34:07,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:34:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:34:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 221 transitions. [2025-03-13 21:34:07,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2025-03-13 21:34:07,285 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 244 flow. Second operand 13 states and 221 transitions. [2025-03-13 21:34:07,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 161 transitions, 994 flow [2025-03-13 21:34:07,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 161 transitions, 974 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-13 21:34:07,293 INFO L231 Difference]: Finished difference. Result has 79 places, 52 transitions, 323 flow [2025-03-13 21:34:07,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=323, PETRI_PLACES=79, PETRI_TRANSITIONS=52} [2025-03-13 21:34:07,294 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2025-03-13 21:34:07,294 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 52 transitions, 323 flow [2025-03-13 21:34:07,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 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-03-13 21:34:07,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:34:07,295 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] [2025-03-13 21:34:07,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:34:07,295 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-03-13 21:34:07,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:34:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1887041352, now seen corresponding path program 5 times [2025-03-13 21:34:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:34:07,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436433260] [2025-03-13 21:34:07,295 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:34:07,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:34:07,311 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:34:07,370 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:34:07,370 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:34:07,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:34:07,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:34:07,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:34:07,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:34:07,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:34:07,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:34:07,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:34:07,448 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:34:07,448 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-13 21:34:07,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-13 21:34:07,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-13 21:34:07,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-13 21:34:07,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-13 21:34:07,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-13 21:34:07,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:34:07,450 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2025-03-13 21:34:07,519 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:34:07,519 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:34:07,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:34:07 BasicIcfg [2025-03-13 21:34:07,524 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:34:07,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:34:07,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:34:07,524 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:34:07,525 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:33:58" (3/4) ... [2025-03-13 21:34:07,525 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:34:07,613 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-03-13 21:34:07,650 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:34:07,650 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:34:07,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:34:07,653 INFO L158 Benchmark]: Toolchain (without parser) took 9878.63ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 105.4MB in the beginning and 346.8MB in the end (delta: -241.4MB). Peak memory consumption was 278.7MB. Max. memory is 16.1GB. [2025-03-13 21:34:07,653 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:34:07,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.57ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 81.7MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-13 21:34:07,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.66ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 79.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:34:07,655 INFO L158 Benchmark]: Boogie Preprocessor took 42.82ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 76.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:34:07,656 INFO L158 Benchmark]: IcfgBuilder took 687.82ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 77.8MB in the end (delta: -1.5MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-03-13 21:34:07,656 INFO L158 Benchmark]: TraceAbstraction took 8535.95ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 77.0MB in the beginning and 359.4MB in the end (delta: -282.4MB). Peak memory consumption was 230.8MB. Max. memory is 16.1GB. [2025-03-13 21:34:07,656 INFO L158 Benchmark]: Witness Printer took 125.80ms. Allocated memory is still 662.7MB. Free memory was 359.4MB in the beginning and 346.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:34:07,657 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.57ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 81.7MB in the end (delta: 22.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.66ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 79.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.82ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 76.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 687.82ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 77.8MB in the end (delta: -1.5MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8535.95ms. Allocated memory was 142.6MB in the beginning and 662.7MB in the end (delta: 520.1MB). Free memory was 77.0MB in the beginning and 359.4MB in the end (delta: -282.4MB). Peak memory consumption was 230.8MB. Max. memory is 16.1GB. * Witness Printer took 125.80ms. Allocated memory is still 662.7MB. Free memory was 359.4MB in the beginning and 346.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: 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: 823]: 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: 819]: 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: 821]: 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, 64 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: 8.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 518 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 508 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1279 IncrementalHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 3 mSDtfsCounter, 1279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=8, InterpolantAutomatonStates: 51, 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.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 1285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-03-13 21:34:07,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE