./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:24:49,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:24:49,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:24:49,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:24:49,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:24:49,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:24:49,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:24:49,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:24:49,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:24:49,590 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:24:49,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:24:49,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:24:49,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:24:49,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:24:49,591 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:24:49,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:24:49,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:24:49,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:24:49,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:24:49,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:24:49,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:24:49,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:24:49,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:24:49,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:24:49,592 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:24:49,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:24:49,592 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:24:49,592 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:24:49,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:24:49,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:24:49,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:24:49,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:24:49,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:24:49,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:24:49,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:24:49,594 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:24:49,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:24:49,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:24:49,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:24:49,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:24:49,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:24:49,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:24:49,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:24:49,594 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2025-02-06 04:24:49,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:24:49,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:24:49,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:24:49,834 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:24:49,834 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:24:49,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 04:24:51,016 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c633187a6/75eca70f3bd34418aedc7c6c54aff46a/FLAG39785d54f [2025-02-06 04:24:51,294 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:24:51,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 04:24:51,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c633187a6/75eca70f3bd34418aedc7c6c54aff46a/FLAG39785d54f [2025-02-06 04:24:51,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c633187a6/75eca70f3bd34418aedc7c6c54aff46a [2025-02-06 04:24:51,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:24:51,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:24:51,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:24:51,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:24:51,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:24:51,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59da5561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51, skipping insertion in model container [2025-02-06 04:24:51,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:24:51,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2025-02-06 04:24:51,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:24:51,600 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:24:51,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2025-02-06 04:24:51,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:24:51,689 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:24:51,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51 WrapperNode [2025-02-06 04:24:51,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:24:51,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:24:51,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:24:51,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:24:51,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,726 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2025-02-06 04:24:51,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:24:51,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:24:51,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:24:51,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:24:51,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,747 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 04:24:51,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:24:51,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:24:51,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:24:51,761 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:24:51,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (1/1) ... [2025-02-06 04:24:51,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:24:51,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:24:51,791 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:24:51,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:24:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:24:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:24:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 04:24:51,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 04:24:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 04:24:51,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 04:24:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 04:24:51,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 04:24:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:24:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:24:51,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:24:51,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:24:51,814 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:24:51,911 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:24:51,912 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:24:52,156 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:24:52,157 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:24:52,341 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:24:52,342 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:24:52,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:24:52 BoogieIcfgContainer [2025-02-06 04:24:52,342 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:24:52,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:24:52,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:24:52,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:24:52,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:24:51" (1/3) ... [2025-02-06 04:24:52,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cc7f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:24:52, skipping insertion in model container [2025-02-06 04:24:52,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:24:51" (2/3) ... [2025-02-06 04:24:52,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cc7f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:24:52, skipping insertion in model container [2025-02-06 04:24:52,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:24:52" (3/3) ... [2025-02-06 04:24:52,350 INFO L128 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-06 04:24:52,364 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:24:52,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 38 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-06 04:24:52,367 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:24:52,420 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:24:52,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 88 flow [2025-02-06 04:24:52,481 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2025-02-06 04:24:52,483 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:24:52,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-02-06 04:24:52,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 38 transitions, 88 flow [2025-02-06 04:24:52,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 35 transitions, 79 flow [2025-02-06 04:24:52,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:24:52,510 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;@15a9c04b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:24:52,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:24:52,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:24:52,514 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-06 04:24:52,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:24:52,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:24:52,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-06 04:24:52,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:24:52,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:24:52,520 INFO L85 PathProgramCache]: Analyzing trace with hash 10777765, now seen corresponding path program 1 times [2025-02-06 04:24:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:24:52,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594990644] [2025-02-06 04:24:52,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:24:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:24:52,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 04:24:52,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 04:24:52,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:24:52,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:24:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:24:52,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:24:52,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594990644] [2025-02-06 04:24:52,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594990644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:24:52,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:24:52,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 04:24:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163731615] [2025-02-06 04:24:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:24:52,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:24:52,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:24:52,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:24:52,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:24:52,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-02-06 04:24:52,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:52,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:24:52,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-02-06 04:24:52,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:24:53,601 INFO L124 PetriNetUnfolderBase]: 3481/5073 cut-off events. [2025-02-06 04:24:53,601 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-06 04:24:53,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10146 conditions, 5073 events. 3481/5073 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 27604 event pairs, 371 based on Foata normal form. 175/5214 useless extension candidates. Maximal degree in co-relation 10135. Up to 4371 conditions per place. [2025-02-06 04:24:53,634 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 43 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2025-02-06 04:24:53,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 215 flow [2025-02-06 04:24:53,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:24:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:24:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-02-06 04:24:53,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6754385964912281 [2025-02-06 04:24:53,648 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 79 flow. Second operand 3 states and 77 transitions. [2025-02-06 04:24:53,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 215 flow [2025-02-06 04:24:53,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 210 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 04:24:53,657 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 74 flow [2025-02-06 04:24:53,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, 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=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2025-02-06 04:24:53,662 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2025-02-06 04:24:53,662 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 74 flow [2025-02-06 04:24:53,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:53,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:24:53,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:24:53,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:24:53,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:24:53,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:24:53,663 INFO L85 PathProgramCache]: Analyzing trace with hash 529904352, now seen corresponding path program 1 times [2025-02-06 04:24:53,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:24:53,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020002317] [2025-02-06 04:24:53,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:24:53,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:24:53,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 04:24:53,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:24:53,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:24:53,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:24:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:24:54,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:24:54,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020002317] [2025-02-06 04:24:54,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020002317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:24:54,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:24:54,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:24:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933600804] [2025-02-06 04:24:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:24:54,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:24:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:24:54,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:24:54,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:24:54,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:24:54,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:54,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:24:54,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:24:54,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:24:55,925 INFO L124 PetriNetUnfolderBase]: 5773/8468 cut-off events. [2025-02-06 04:24:55,926 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2025-02-06 04:24:55,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17197 conditions, 8468 events. 5773/8468 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 48012 event pairs, 941 based on Foata normal form. 0/8271 useless extension candidates. Maximal degree in co-relation 17187. Up to 4875 conditions per place. [2025-02-06 04:24:56,008 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 53 selfloop transitions, 10 changer transitions 97/164 dead transitions. [2025-02-06 04:24:56,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 164 transitions, 678 flow [2025-02-06 04:24:56,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:24:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:24:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 247 transitions. [2025-02-06 04:24:56,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-06 04:24:56,018 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 74 flow. Second operand 12 states and 247 transitions. [2025-02-06 04:24:56,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 164 transitions, 678 flow [2025-02-06 04:24:56,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 164 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 04:24:56,023 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 167 flow [2025-02-06 04:24:56,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2025-02-06 04:24:56,024 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2025-02-06 04:24:56,024 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 167 flow [2025-02-06 04:24:56,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:56,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:24:56,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:24:56,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:24:56,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:24:56,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:24:56,029 INFO L85 PathProgramCache]: Analyzing trace with hash -706995487, now seen corresponding path program 1 times [2025-02-06 04:24:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:24:56,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412476860] [2025-02-06 04:24:56,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:24:56,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:24:56,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 04:24:56,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 04:24:56,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:24:56,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:24:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:24:56,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:24:56,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412476860] [2025-02-06 04:24:56,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412476860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:24:56,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:24:56,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:24:56,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145416349] [2025-02-06 04:24:56,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:24:56,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:24:56,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:24:56,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:24:56,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:24:56,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:24:56,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 39 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:56,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:24:56,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:24:56,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:24:56,892 INFO L124 PetriNetUnfolderBase]: 4440/6599 cut-off events. [2025-02-06 04:24:56,896 INFO L125 PetriNetUnfolderBase]: For 11479/11482 co-relation queries the response was YES. [2025-02-06 04:24:56,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21316 conditions, 6599 events. 4440/6599 cut-off events. For 11479/11482 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 34815 event pairs, 812 based on Foata normal form. 192/6783 useless extension candidates. Maximal degree in co-relation 21297. Up to 4646 conditions per place. [2025-02-06 04:24:56,968 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 51 selfloop transitions, 3 changer transitions 61/119 dead transitions. [2025-02-06 04:24:56,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 119 transitions, 767 flow [2025-02-06 04:24:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:24:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:24:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2025-02-06 04:24:56,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2025-02-06 04:24:56,970 INFO L175 Difference]: Start difference. First operand has 59 places, 39 transitions, 167 flow. Second operand 7 states and 140 transitions. [2025-02-06 04:24:56,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 119 transitions, 767 flow [2025-02-06 04:24:57,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 119 transitions, 715 flow, removed 26 selfloop flow, removed 5 redundant places. [2025-02-06 04:24:57,026 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 170 flow [2025-02-06 04:24:57,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=151, 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=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2025-02-06 04:24:57,027 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2025-02-06 04:24:57,027 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 170 flow [2025-02-06 04:24:57,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:57,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:24:57,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:24:57,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:24:57,028 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:24:57,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:24:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1812092030, now seen corresponding path program 1 times [2025-02-06 04:24:57,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:24:57,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051345271] [2025-02-06 04:24:57,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:24:57,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:24:57,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 04:24:57,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 04:24:57,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:24:57,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:24:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:24:57,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:24:57,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051345271] [2025-02-06 04:24:57,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051345271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:24:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:24:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:24:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155088144] [2025-02-06 04:24:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:24:57,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:24:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:24:57,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:24:57,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:24:57,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:24:57,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:57,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:24:57,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:24:57,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:24:58,086 INFO L124 PetriNetUnfolderBase]: 4155/6186 cut-off events. [2025-02-06 04:24:58,086 INFO L125 PetriNetUnfolderBase]: For 8568/8568 co-relation queries the response was YES. [2025-02-06 04:24:58,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19186 conditions, 6186 events. 4155/6186 cut-off events. For 8568/8568 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 32487 event pairs, 1611 based on Foata normal form. 138/6320 useless extension candidates. Maximal degree in co-relation 19165. Up to 5096 conditions per place. [2025-02-06 04:24:58,122 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 47 selfloop transitions, 3 changer transitions 43/97 dead transitions. [2025-02-06 04:24:58,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 97 transitions, 586 flow [2025-02-06 04:24:58,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:24:58,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:24:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2025-02-06 04:24:58,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48872180451127817 [2025-02-06 04:24:58,123 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 170 flow. Second operand 7 states and 130 transitions. [2025-02-06 04:24:58,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 97 transitions, 586 flow [2025-02-06 04:24:58,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 562 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-06 04:24:58,151 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 191 flow [2025-02-06 04:24:58,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2025-02-06 04:24:58,152 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2025-02-06 04:24:58,152 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 191 flow [2025-02-06 04:24:58,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:58,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:24:58,152 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-02-06 04:24:58,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:24:58,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:24:58,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:24:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash -324538345, now seen corresponding path program 1 times [2025-02-06 04:24:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:24:58,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647166590] [2025-02-06 04:24:58,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:24:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:24:58,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:24:58,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:24:58,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:24:58,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:24:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:24:58,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:24:58,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647166590] [2025-02-06 04:24:58,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647166590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:24:58,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:24:58,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:24:58,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077012929] [2025-02-06 04:24:58,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:24:58,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:24:58,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:24:58,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:24:58,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:24:58,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:24:58,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:58,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:24:58,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:24:58,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:24:59,513 INFO L124 PetriNetUnfolderBase]: 6117/8957 cut-off events. [2025-02-06 04:24:59,513 INFO L125 PetriNetUnfolderBase]: For 13764/13767 co-relation queries the response was YES. [2025-02-06 04:24:59,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29598 conditions, 8957 events. 6117/8957 cut-off events. For 13764/13767 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 49781 event pairs, 697 based on Foata normal form. 158/9110 useless extension candidates. Maximal degree in co-relation 29576. Up to 3885 conditions per place. [2025-02-06 04:24:59,545 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 62 selfloop transitions, 10 changer transitions 48/124 dead transitions. [2025-02-06 04:24:59,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 124 transitions, 809 flow [2025-02-06 04:24:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:24:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 04:24:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2025-02-06 04:24:59,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-02-06 04:24:59,547 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 191 flow. Second operand 7 states and 152 transitions. [2025-02-06 04:24:59,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 124 transitions, 809 flow [2025-02-06 04:24:59,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 124 transitions, 792 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-06 04:24:59,568 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 255 flow [2025-02-06 04:24:59,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2025-02-06 04:24:59,569 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2025-02-06 04:24:59,569 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 255 flow [2025-02-06 04:24:59,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:59,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:24:59,569 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-02-06 04:24:59,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:24:59,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:24:59,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:24:59,570 INFO L85 PathProgramCache]: Analyzing trace with hash -978677067, now seen corresponding path program 2 times [2025-02-06 04:24:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:24:59,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178723584] [2025-02-06 04:24:59,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:24:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:24:59,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:24:59,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:24:59,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:24:59,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:24:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:24:59,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:24:59,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178723584] [2025-02-06 04:24:59,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178723584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:24:59,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:24:59,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:24:59,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045814881] [2025-02-06 04:24:59,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:24:59,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:24:59,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:24:59,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:24:59,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:24:59,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:24:59,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:24:59,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:24:59,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:24:59,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:00,858 INFO L124 PetriNetUnfolderBase]: 7643/11282 cut-off events. [2025-02-06 04:25:00,858 INFO L125 PetriNetUnfolderBase]: For 24413/24418 co-relation queries the response was YES. [2025-02-06 04:25:00,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38748 conditions, 11282 events. 7643/11282 cut-off events. For 24413/24418 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 64214 event pairs, 1859 based on Foata normal form. 263/11536 useless extension candidates. Maximal degree in co-relation 38722. Up to 3496 conditions per place. [2025-02-06 04:25:00,891 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 53 selfloop transitions, 4 changer transitions 102/163 dead transitions. [2025-02-06 04:25:00,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 163 transitions, 1112 flow [2025-02-06 04:25:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:25:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:25:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 226 transitions. [2025-02-06 04:25:00,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5406698564593302 [2025-02-06 04:25:00,894 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 255 flow. Second operand 11 states and 226 transitions. [2025-02-06 04:25:00,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 163 transitions, 1112 flow [2025-02-06 04:25:00,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 163 transitions, 1071 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-02-06 04:25:00,938 INFO L231 Difference]: Finished difference. Result has 73 places, 41 transitions, 237 flow [2025-02-06 04:25:00,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=237, PETRI_PLACES=73, PETRI_TRANSITIONS=41} [2025-02-06 04:25:00,939 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2025-02-06 04:25:00,939 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 41 transitions, 237 flow [2025-02-06 04:25:00,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:00,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:00,940 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-02-06 04:25:00,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:25:00,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:00,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1328720247, now seen corresponding path program 1 times [2025-02-06 04:25:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:00,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161221457] [2025-02-06 04:25:00,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:00,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:00,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:25:00,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:25:00,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:00,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:01,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:01,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161221457] [2025-02-06 04:25:01,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161221457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:01,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:01,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:25:01,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364762942] [2025-02-06 04:25:01,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:01,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:25:01,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:01,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:25:01,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:25:01,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:25:01,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 41 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:01,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:01,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:25:01,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:01,874 INFO L124 PetriNetUnfolderBase]: 4622/7034 cut-off events. [2025-02-06 04:25:01,875 INFO L125 PetriNetUnfolderBase]: For 23029/23029 co-relation queries the response was YES. [2025-02-06 04:25:01,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25543 conditions, 7034 events. 4622/7034 cut-off events. For 23029/23029 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 38536 event pairs, 1940 based on Foata normal form. 111/7142 useless extension candidates. Maximal degree in co-relation 25512. Up to 5704 conditions per place. [2025-02-06 04:25:01,904 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 57 selfloop transitions, 8 changer transitions 43/112 dead transitions. [2025-02-06 04:25:01,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 846 flow [2025-02-06 04:25:01,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:25:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:25:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2025-02-06 04:25:01,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4967105263157895 [2025-02-06 04:25:01,905 INFO L175 Difference]: Start difference. First operand has 73 places, 41 transitions, 237 flow. Second operand 8 states and 151 transitions. [2025-02-06 04:25:01,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 846 flow [2025-02-06 04:25:01,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 112 transitions, 777 flow, removed 24 selfloop flow, removed 10 redundant places. [2025-02-06 04:25:01,961 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 276 flow [2025-02-06 04:25:01,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=276, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2025-02-06 04:25:01,962 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2025-02-06 04:25:01,962 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 276 flow [2025-02-06 04:25:01,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:01,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:01,962 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-02-06 04:25:01,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:25:01,962 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:01,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:01,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1149993, now seen corresponding path program 2 times [2025-02-06 04:25:01,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:01,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371986908] [2025-02-06 04:25:01,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:25:01,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:01,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-02-06 04:25:01,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 04:25:01,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:25:01,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:02,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:02,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371986908] [2025-02-06 04:25:02,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371986908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:02,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:02,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:25:02,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766832821] [2025-02-06 04:25:02,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:02,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:25:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:02,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:25:02,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:25:02,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:25:02,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 276 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:02,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:02,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:25:02,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:03,181 INFO L124 PetriNetUnfolderBase]: 4514/6862 cut-off events. [2025-02-06 04:25:03,181 INFO L125 PetriNetUnfolderBase]: For 20248/20248 co-relation queries the response was YES. [2025-02-06 04:25:03,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25272 conditions, 6862 events. 4514/6862 cut-off events. For 20248/20248 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 36962 event pairs, 1880 based on Foata normal form. 111/6970 useless extension candidates. Maximal degree in co-relation 25244. Up to 5656 conditions per place. [2025-02-06 04:25:03,203 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 54 selfloop transitions, 8 changer transitions 43/109 dead transitions. [2025-02-06 04:25:03,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 109 transitions, 822 flow [2025-02-06 04:25:03,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:25:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:25:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2025-02-06 04:25:03,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2025-02-06 04:25:03,204 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 276 flow. Second operand 8 states and 148 transitions. [2025-02-06 04:25:03,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 109 transitions, 822 flow [2025-02-06 04:25:03,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 774 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-02-06 04:25:03,231 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 275 flow [2025-02-06 04:25:03,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=275, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2025-02-06 04:25:03,232 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2025-02-06 04:25:03,232 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 275 flow [2025-02-06 04:25:03,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:03,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:03,232 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] [2025-02-06 04:25:03,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:25:03,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:03,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:03,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1390016676, now seen corresponding path program 1 times [2025-02-06 04:25:03,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:03,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004244975] [2025-02-06 04:25:03,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:03,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:03,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:25:03,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:25:03,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:03,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:03,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:03,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004244975] [2025-02-06 04:25:03,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004244975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:03,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:03,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:25:03,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393519026] [2025-02-06 04:25:03,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:03,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:25:03,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:03,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:25:03,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:25:03,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:25:03,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 275 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:03,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:03,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:25:03,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:04,501 INFO L124 PetriNetUnfolderBase]: 4772/7244 cut-off events. [2025-02-06 04:25:04,501 INFO L125 PetriNetUnfolderBase]: For 21762/21762 co-relation queries the response was YES. [2025-02-06 04:25:04,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27012 conditions, 7244 events. 4772/7244 cut-off events. For 21762/21762 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 39323 event pairs, 1659 based on Foata normal form. 118/7359 useless extension candidates. Maximal degree in co-relation 26982. Up to 5962 conditions per place. [2025-02-06 04:25:04,530 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 61 selfloop transitions, 11 changer transitions 34/110 dead transitions. [2025-02-06 04:25:04,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 110 transitions, 861 flow [2025-02-06 04:25:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:25:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:25:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-02-06 04:25:04,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2025-02-06 04:25:04,532 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 275 flow. Second operand 6 states and 126 transitions. [2025-02-06 04:25:04,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 110 transitions, 861 flow [2025-02-06 04:25:04,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 110 transitions, 831 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-02-06 04:25:04,564 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 364 flow [2025-02-06 04:25:04,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2025-02-06 04:25:04,564 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2025-02-06 04:25:04,564 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 364 flow [2025-02-06 04:25:04,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:04,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:04,564 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] [2025-02-06 04:25:04,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:25:04,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:04,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:04,565 INFO L85 PathProgramCache]: Analyzing trace with hash 903198496, now seen corresponding path program 2 times [2025-02-06 04:25:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:04,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067931480] [2025-02-06 04:25:04,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:25:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:04,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:25:04,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:25:04,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:25:04,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:04,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:04,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067931480] [2025-02-06 04:25:04,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067931480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:04,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:04,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:25:04,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589611263] [2025-02-06 04:25:04,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:04,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:25:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:04,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:25:04,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:25:04,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-02-06 04:25:04,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:04,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:04,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-02-06 04:25:04,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:05,051 INFO L124 PetriNetUnfolderBase]: 3521/5632 cut-off events. [2025-02-06 04:25:05,052 INFO L125 PetriNetUnfolderBase]: For 19006/19006 co-relation queries the response was YES. [2025-02-06 04:25:05,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21002 conditions, 5632 events. 3521/5632 cut-off events. For 19006/19006 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 32645 event pairs, 472 based on Foata normal form. 271/5897 useless extension candidates. Maximal degree in co-relation 20973. Up to 2923 conditions per place. [2025-02-06 04:25:05,077 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 79 selfloop transitions, 5 changer transitions 9/98 dead transitions. [2025-02-06 04:25:05,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 98 transitions, 886 flow [2025-02-06 04:25:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:25:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 04:25:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-02-06 04:25:05,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-02-06 04:25:05,078 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 364 flow. Second operand 4 states and 95 transitions. [2025-02-06 04:25:05,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 98 transitions, 886 flow [2025-02-06 04:25:05,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 822 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-02-06 04:25:05,092 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 336 flow [2025-02-06 04:25:05,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-02-06 04:25:05,092 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2025-02-06 04:25:05,092 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 336 flow [2025-02-06 04:25:05,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:05,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:05,093 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] [2025-02-06 04:25:05,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:25:05,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:05,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:05,093 INFO L85 PathProgramCache]: Analyzing trace with hash 255334595, now seen corresponding path program 1 times [2025-02-06 04:25:05,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:05,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026732963] [2025-02-06 04:25:05,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:05,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:05,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:25:05,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:25:05,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:05,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:05,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:05,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026732963] [2025-02-06 04:25:05,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026732963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:05,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:05,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:25:05,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986218351] [2025-02-06 04:25:05,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:05,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:25:05,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:05,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:25:05,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:25:05,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:25:05,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 336 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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-02-06 04:25:05,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:05,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:25:05,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:06,241 INFO L124 PetriNetUnfolderBase]: 3637/5640 cut-off events. [2025-02-06 04:25:06,241 INFO L125 PetriNetUnfolderBase]: For 17504/17504 co-relation queries the response was YES. [2025-02-06 04:25:06,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22431 conditions, 5640 events. 3637/5640 cut-off events. For 17504/17504 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 30005 event pairs, 1669 based on Foata normal form. 56/5693 useless extension candidates. Maximal degree in co-relation 22402. Up to 4720 conditions per place. [2025-02-06 04:25:06,265 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 69 selfloop transitions, 17 changer transitions 50/140 dead transitions. [2025-02-06 04:25:06,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 140 transitions, 1231 flow [2025-02-06 04:25:06,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:25:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 04:25:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 188 transitions. [2025-02-06 04:25:06,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44976076555023925 [2025-02-06 04:25:06,270 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 336 flow. Second operand 11 states and 188 transitions. [2025-02-06 04:25:06,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 140 transitions, 1231 flow [2025-02-06 04:25:06,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 140 transitions, 1208 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-02-06 04:25:06,282 INFO L231 Difference]: Finished difference. Result has 82 places, 60 transitions, 509 flow [2025-02-06 04:25:06,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=509, PETRI_PLACES=82, PETRI_TRANSITIONS=60} [2025-02-06 04:25:06,282 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2025-02-06 04:25:06,282 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 60 transitions, 509 flow [2025-02-06 04:25:06,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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-02-06 04:25:06,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:06,283 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] [2025-02-06 04:25:06,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:25:06,283 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:06,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:06,283 INFO L85 PathProgramCache]: Analyzing trace with hash -912278721, now seen corresponding path program 2 times [2025-02-06 04:25:06,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:06,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894055511] [2025-02-06 04:25:06,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:25:06,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:06,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-02-06 04:25:06,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 04:25:06,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:25:06,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:06,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:06,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894055511] [2025-02-06 04:25:06,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894055511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:06,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:06,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:25:06,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064095041] [2025-02-06 04:25:06,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:06,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:25:06,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:06,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:25:06,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:25:06,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:25:06,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 60 transitions, 509 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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-02-06 04:25:06,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:06,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:25:06,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:07,341 INFO L124 PetriNetUnfolderBase]: 3583/5594 cut-off events. [2025-02-06 04:25:07,341 INFO L125 PetriNetUnfolderBase]: For 37571/37571 co-relation queries the response was YES. [2025-02-06 04:25:07,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26081 conditions, 5594 events. 3583/5594 cut-off events. For 37571/37571 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 30086 event pairs, 1969 based on Foata normal form. 96/5687 useless extension candidates. Maximal degree in co-relation 26044. Up to 4728 conditions per place. [2025-02-06 04:25:07,369 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 71 selfloop transitions, 9 changer transitions 37/121 dead transitions. [2025-02-06 04:25:07,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 1308 flow [2025-02-06 04:25:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:25:07,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:25:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2025-02-06 04:25:07,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2025-02-06 04:25:07,370 INFO L175 Difference]: Start difference. First operand has 82 places, 60 transitions, 509 flow. Second operand 8 states and 140 transitions. [2025-02-06 04:25:07,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 1308 flow [2025-02-06 04:25:07,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 121 transitions, 1269 flow, removed 17 selfloop flow, removed 3 redundant places. [2025-02-06 04:25:07,398 INFO L231 Difference]: Finished difference. Result has 86 places, 66 transitions, 612 flow [2025-02-06 04:25:07,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=612, PETRI_PLACES=86, PETRI_TRANSITIONS=66} [2025-02-06 04:25:07,399 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2025-02-06 04:25:07,399 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 612 flow [2025-02-06 04:25:07,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 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-02-06 04:25:07,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:07,399 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] [2025-02-06 04:25:07,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:25:07,399 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:07,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1059198221, now seen corresponding path program 1 times [2025-02-06 04:25:07,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708384366] [2025-02-06 04:25:07,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:07,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:07,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 04:25:07,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 04:25:07,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:07,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:07,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:07,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708384366] [2025-02-06 04:25:07,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708384366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:07,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:07,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:25:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663789232] [2025-02-06 04:25:07,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:07,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:25:07,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:07,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:25:07,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:25:07,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-02-06 04:25:07,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 66 transitions, 612 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:07,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:07,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-02-06 04:25:07,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:07,827 INFO L124 PetriNetUnfolderBase]: 2107/3417 cut-off events. [2025-02-06 04:25:07,827 INFO L125 PetriNetUnfolderBase]: For 28583/28583 co-relation queries the response was YES. [2025-02-06 04:25:07,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16063 conditions, 3417 events. 2107/3417 cut-off events. For 28583/28583 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 17920 event pairs, 225 based on Foata normal form. 204/3615 useless extension candidates. Maximal degree in co-relation 16021. Up to 1084 conditions per place. [2025-02-06 04:25:07,837 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 97 selfloop transitions, 8 changer transitions 11/121 dead transitions. [2025-02-06 04:25:07,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 121 transitions, 1430 flow [2025-02-06 04:25:07,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:25:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 04:25:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-02-06 04:25:07,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6263157894736842 [2025-02-06 04:25:07,838 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 612 flow. Second operand 5 states and 119 transitions. [2025-02-06 04:25:07,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 121 transitions, 1430 flow [2025-02-06 04:25:07,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 1368 flow, removed 26 selfloop flow, removed 5 redundant places. [2025-02-06 04:25:07,850 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 573 flow [2025-02-06 04:25:07,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=573, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2025-02-06 04:25:07,851 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2025-02-06 04:25:07,851 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 573 flow [2025-02-06 04:25:07,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:07,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:07,851 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] [2025-02-06 04:25:07,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:25:07,851 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:07,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:07,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2038768868, now seen corresponding path program 1 times [2025-02-06 04:25:07,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:07,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299867654] [2025-02-06 04:25:07,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:07,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 04:25:07,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 04:25:07,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:07,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:07,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299867654] [2025-02-06 04:25:07,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299867654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:07,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:07,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:25:07,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239121313] [2025-02-06 04:25:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:07,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:25:07,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:07,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:25:07,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:25:07,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2025-02-06 04:25:07,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 573 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-02-06 04:25:07,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:07,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2025-02-06 04:25:07,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:08,194 INFO L124 PetriNetUnfolderBase]: 1220/1980 cut-off events. [2025-02-06 04:25:08,194 INFO L125 PetriNetUnfolderBase]: For 15199/15199 co-relation queries the response was YES. [2025-02-06 04:25:08,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9316 conditions, 1980 events. 1220/1980 cut-off events. For 15199/15199 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9346 event pairs, 150 based on Foata normal form. 80/2054 useless extension candidates. Maximal degree in co-relation 9275. Up to 696 conditions per place. [2025-02-06 04:25:08,202 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 62 selfloop transitions, 11 changer transitions 32/110 dead transitions. [2025-02-06 04:25:08,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 110 transitions, 1192 flow [2025-02-06 04:25:08,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:25:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:25:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2025-02-06 04:25:08,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5350877192982456 [2025-02-06 04:25:08,204 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 573 flow. Second operand 6 states and 122 transitions. [2025-02-06 04:25:08,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 110 transitions, 1192 flow [2025-02-06 04:25:08,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 110 transitions, 1036 flow, removed 60 selfloop flow, removed 10 redundant places. [2025-02-06 04:25:08,216 INFO L231 Difference]: Finished difference. Result has 80 places, 47 transitions, 352 flow [2025-02-06 04:25:08,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=80, PETRI_TRANSITIONS=47} [2025-02-06 04:25:08,217 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2025-02-06 04:25:08,217 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 47 transitions, 352 flow [2025-02-06 04:25:08,217 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-02-06 04:25:08,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:08,217 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] [2025-02-06 04:25:08,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:25:08,217 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:08,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:08,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1493871228, now seen corresponding path program 1 times [2025-02-06 04:25:08,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:08,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112848257] [2025-02-06 04:25:08,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:25:08,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:08,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:25:08,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:25:08,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:08,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:08,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:08,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112848257] [2025-02-06 04:25:08,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112848257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:08,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:08,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:25:08,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995105909] [2025-02-06 04:25:08,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:08,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:25:08,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:08,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:25:08,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:25:08,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:25:08,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 47 transitions, 352 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:08,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:08,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:25:08,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:09,096 INFO L124 PetriNetUnfolderBase]: 779/1259 cut-off events. [2025-02-06 04:25:09,097 INFO L125 PetriNetUnfolderBase]: For 6320/6320 co-relation queries the response was YES. [2025-02-06 04:25:09,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5413 conditions, 1259 events. 779/1259 cut-off events. For 6320/6320 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4921 event pairs, 194 based on Foata normal form. 8/1266 useless extension candidates. Maximal degree in co-relation 5377. Up to 789 conditions per place. [2025-02-06 04:25:09,101 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 56 selfloop transitions, 16 changer transitions 17/93 dead transitions. [2025-02-06 04:25:09,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 93 transitions, 808 flow [2025-02-06 04:25:09,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:25:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 04:25:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2025-02-06 04:25:09,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40789473684210525 [2025-02-06 04:25:09,104 INFO L175 Difference]: Start difference. First operand has 80 places, 47 transitions, 352 flow. Second operand 8 states and 124 transitions. [2025-02-06 04:25:09,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 93 transitions, 808 flow [2025-02-06 04:25:09,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 567 flow, removed 69 selfloop flow, removed 22 redundant places. [2025-02-06 04:25:09,110 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 319 flow [2025-02-06 04:25:09,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=319, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2025-02-06 04:25:09,111 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2025-02-06 04:25:09,111 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 319 flow [2025-02-06 04:25:09,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:09,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:09,111 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] [2025-02-06 04:25:09,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:25:09,112 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:09,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1072234734, now seen corresponding path program 2 times [2025-02-06 04:25:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:09,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144794386] [2025-02-06 04:25:09,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:25:09,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:09,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:25:09,152 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:25:09,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 04:25:09,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:25:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:25:09,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:25:09,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144794386] [2025-02-06 04:25:09,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144794386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:25:09,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:25:09,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:25:09,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404877792] [2025-02-06 04:25:09,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:25:09,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:25:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:25:09,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:25:09,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:25:09,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 38 [2025-02-06 04:25:09,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 319 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:09,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:25:09,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 38 [2025-02-06 04:25:09,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:25:10,272 INFO L124 PetriNetUnfolderBase]: 911/1490 cut-off events. [2025-02-06 04:25:10,272 INFO L125 PetriNetUnfolderBase]: For 2529/2529 co-relation queries the response was YES. [2025-02-06 04:25:10,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4785 conditions, 1490 events. 911/1490 cut-off events. For 2529/2529 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6276 event pairs, 381 based on Foata normal form. 8/1497 useless extension candidates. Maximal degree in co-relation 4762. Up to 732 conditions per place. [2025-02-06 04:25:10,276 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 43 selfloop transitions, 7 changer transitions 22/76 dead transitions. [2025-02-06 04:25:10,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 544 flow [2025-02-06 04:25:10,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:25:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:25:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-02-06 04:25:10,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3991228070175439 [2025-02-06 04:25:10,277 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 319 flow. Second operand 6 states and 91 transitions. [2025-02-06 04:25:10,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 544 flow [2025-02-06 04:25:10,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 76 transitions, 511 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-02-06 04:25:10,281 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 268 flow [2025-02-06 04:25:10,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2025-02-06 04:25:10,281 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2025-02-06 04:25:10,281 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 268 flow [2025-02-06 04:25:10,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:25:10,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:25:10,282 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] [2025-02-06 04:25:10,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:25:10,282 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-02-06 04:25:10,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:25:10,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1870287060, now seen corresponding path program 3 times [2025-02-06 04:25:10,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:25:10,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626967523] [2025-02-06 04:25:10,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:25:10,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:25:10,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:25:10,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:25:10,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 04:25:10,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:25:10,317 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:25:10,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 04:25:10,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 04:25:10,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:25:10,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:25:10,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:25:10,373 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:25:10,374 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-02-06 04:25:10,375 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-06 04:25:10,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-02-06 04:25:10,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 04:25:10,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 04:25:10,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-06 04:25:10,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 04:25:10,377 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:25:10,436 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 04:25:10,437 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:25:10,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:25:10 BasicIcfg [2025-02-06 04:25:10,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:25:10,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:25:10,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:25:10,444 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:25:10,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:24:52" (3/4) ... [2025-02-06 04:25:10,445 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 04:25:10,516 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-02-06 04:25:10,558 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 04:25:10,558 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 04:25:10,558 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:25:10,559 INFO L158 Benchmark]: Toolchain (without parser) took 19238.63ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 111.2MB in the beginning and 665.8MB in the end (delta: -554.6MB). Peak memory consumption was 864.1MB. Max. memory is 16.1GB. [2025-02-06 04:25:10,560 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:25:10,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.73ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 88.1MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 04:25:10,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.77ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 85.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:25:10,561 INFO L158 Benchmark]: Boogie Preprocessor took 33.96ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 82.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:25:10,562 INFO L158 Benchmark]: IcfgBuilder took 580.84ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 99.6MB in the end (delta: -17.2MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-02-06 04:25:10,562 INFO L158 Benchmark]: TraceAbstraction took 18098.45ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 98.8MB in the beginning and 678.4MB in the end (delta: -579.6MB). Peak memory consumption was 832.7MB. Max. memory is 16.1GB. [2025-02-06 04:25:10,562 INFO L158 Benchmark]: Witness Printer took 114.67ms. Allocated memory is still 1.6GB. Free memory was 678.4MB in the beginning and 665.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:25:10,563 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.39ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.73ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 88.1MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.77ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 85.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.96ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 82.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 580.84ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 99.6MB in the end (delta: -17.2MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18098.45ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 98.8MB in the beginning and 678.4MB in the end (delta: -579.6MB). Peak memory consumption was 832.7MB. Max. memory is 16.1GB. * Witness Printer took 114.67ms. Allocated memory is still 1.6GB. Free memory was 678.4MB in the beginning and 665.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; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2177; [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L815] 0 pthread_t t2178; [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L817] 0 pthread_t t2179; [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L788] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177=-2, t2178=-1, t2179=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L846] 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=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 816]: 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: 814]: 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: 818]: 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, 62 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: 17.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1030 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1017 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3289 IncrementalHoareTripleChecker+Invalid, 3384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 8 mSDtfsCounter, 3289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=612occurred in iteration=12, InterpolantAutomatonStates: 117, 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.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 2688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-06 04:25:10,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE