./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:46:03,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:46:03,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:46:03,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:46:03,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:46:03,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:46:03,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:46:03,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:46:03,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:46:03,475 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:46:03,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:46:03,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:46:03,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:46:03,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:46:03,476 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:46:03,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:46:03,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:46:03,476 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:46:03,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:46:03,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:46:03,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:46:03,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:46:03,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:46:03,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:46:03,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:46:03,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:46:03,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:46:03,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:46:03,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:46:03,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:46:03,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:46:03,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:46:03,479 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2025-03-13 21:46:03,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:46:03,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:46:03,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:46:03,696 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:46:03,696 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:46:03,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-03-13 21:46:04,830 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14aaa4c5a/f452a46cbb564ba0a704381285dc3ca6/FLAG0e4737637 [2025-03-13 21:46:05,071 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:46:05,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-03-13 21:46:05,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14aaa4c5a/f452a46cbb564ba0a704381285dc3ca6/FLAG0e4737637 [2025-03-13 21:46:05,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14aaa4c5a/f452a46cbb564ba0a704381285dc3ca6 [2025-03-13 21:46:05,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:46:05,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:46:05,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:46:05,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:46:05,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:46:05,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfc3d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05, skipping insertion in model container [2025-03-13 21:46:05,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:46:05,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2025-03-13 21:46:05,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:46:05,583 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:46:05,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4226,4239] [2025-03-13 21:46:05,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:46:05,623 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:46:05,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05 WrapperNode [2025-03-13 21:46:05,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:46:05,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:46:05,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:46:05,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:46:05,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,663 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 289 [2025-03-13 21:46:05,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:46:05,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:46:05,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:46:05,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:46:05,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,703 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-13 21:46:05,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:46:05,726 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:46:05,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:46:05,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:46:05,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (1/1) ... [2025-03-13 21:46:05,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:46:05,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:05,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:46:05,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:46:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:46:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:46:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:46:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:46:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:46:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:46:05,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:46:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 21:46:05,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 21:46:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:46:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:46:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:46:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:46:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:46:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:46:05,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:46:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:46:05,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:46:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:46:05,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:46:05,780 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:46:05,882 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:46:05,884 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:46:06,266 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:46:06,268 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:46:06,268 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:46:06,585 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:46:06,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:46:06 BoogieIcfgContainer [2025-03-13 21:46:06,586 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:46:06,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:46:06,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:46:06,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:46:06,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:46:05" (1/3) ... [2025-03-13 21:46:06,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1511654f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:46:06, skipping insertion in model container [2025-03-13 21:46:06,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:46:05" (2/3) ... [2025-03-13 21:46:06,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1511654f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:46:06, skipping insertion in model container [2025-03-13 21:46:06,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:46:06" (3/3) ... [2025-03-13 21:46:06,593 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2025-03-13 21:46:06,605 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:46:06,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt2.wvr.c that has 5 procedures, 43 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-13 21:46:06,606 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:46:06,679 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:46:06,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 124 flow [2025-03-13 21:46:06,719 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-03-13 21:46:06,721 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:46:06,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 6/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-03-13 21:46:06,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 48 transitions, 124 flow [2025-03-13 21:46:06,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 43 transitions, 110 flow [2025-03-13 21:46:06,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:46:06,745 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;@7ae454f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:46:06,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-13 21:46:06,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:46:06,762 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2025-03-13 21:46:06,762 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:46:06,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:06,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:06,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:06,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash -417808382, now seen corresponding path program 1 times [2025-03-13 21:46:06,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:06,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656838343] [2025-03-13 21:46:06,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:06,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:46:06,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:46:06,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:06,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:07,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:07,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656838343] [2025-03-13 21:46:07,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656838343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:07,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:07,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:46:07,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138707960] [2025-03-13 21:46:07,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:07,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:46:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:07,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:46:07,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:46:07,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-13 21:46:07,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:07,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:07,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-13 21:46:07,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:08,238 INFO L124 PetriNetUnfolderBase]: 4371/6150 cut-off events. [2025-03-13 21:46:08,239 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2025-03-13 21:46:08,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12327 conditions, 6150 events. 4371/6150 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 31796 event pairs, 560 based on Foata normal form. 280/6387 useless extension candidates. Maximal degree in co-relation 10885. Up to 3269 conditions per place. [2025-03-13 21:46:08,280 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 84 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2025-03-13 21:46:08,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 100 transitions, 439 flow [2025-03-13 21:46:08,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:46:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:46:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2025-03-13 21:46:08,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-13 21:46:08,295 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 110 flow. Second operand 6 states and 171 transitions. [2025-03-13 21:46:08,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 100 transitions, 439 flow [2025-03-13 21:46:08,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 100 transitions, 401 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 21:46:08,311 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 141 flow [2025-03-13 21:46:08,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-03-13 21:46:08,317 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2025-03-13 21:46:08,317 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 141 flow [2025-03-13 21:46:08,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:08,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:08,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:08,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:46:08,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:08,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:08,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2106354126, now seen corresponding path program 1 times [2025-03-13 21:46:08,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:08,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207047272] [2025-03-13 21:46:08,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:08,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:08,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 21:46:08,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 21:46:08,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:08,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:08,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207047272] [2025-03-13 21:46:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207047272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:08,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:08,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:46:08,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940260011] [2025-03-13 21:46:08,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:08,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:46:08,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:08,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:46:08,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:46:08,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-13 21:46:08,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:08,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:08,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-13 21:46:08,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:09,097 INFO L124 PetriNetUnfolderBase]: 5126/7119 cut-off events. [2025-03-13 21:46:09,097 INFO L125 PetriNetUnfolderBase]: For 3909/3909 co-relation queries the response was YES. [2025-03-13 21:46:09,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16981 conditions, 7119 events. 5126/7119 cut-off events. For 3909/3909 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 37462 event pairs, 3571 based on Foata normal form. 217/7174 useless extension candidates. Maximal degree in co-relation 9462. Up to 5721 conditions per place. [2025-03-13 21:46:09,137 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 38 selfloop transitions, 2 changer transitions 26/75 dead transitions. [2025-03-13 21:46:09,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 343 flow [2025-03-13 21:46:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:46:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:46:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2025-03-13 21:46:09,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-13 21:46:09,142 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 141 flow. Second operand 5 states and 128 transitions. [2025-03-13 21:46:09,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 343 flow [2025-03-13 21:46:09,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:46:09,150 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 158 flow [2025-03-13 21:46:09,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2025-03-13 21:46:09,151 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2025-03-13 21:46:09,151 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 158 flow [2025-03-13 21:46:09,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:09,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:09,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:46:09,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:09,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash 334936313, now seen corresponding path program 1 times [2025-03-13 21:46:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:09,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398962969] [2025-03-13 21:46:09,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:09,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:46:09,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:46:09,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:09,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:46:09,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398962969] [2025-03-13 21:46:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398962969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:09,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:46:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227260443] [2025-03-13 21:46:09,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:09,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:46:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:09,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:46:09,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:46:09,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-13 21:46:09,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:09,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:09,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-13 21:46:09,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:10,320 INFO L124 PetriNetUnfolderBase]: 7623/10626 cut-off events. [2025-03-13 21:46:10,320 INFO L125 PetriNetUnfolderBase]: For 4893/4893 co-relation queries the response was YES. [2025-03-13 21:46:10,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25109 conditions, 10626 events. 7623/10626 cut-off events. For 4893/4893 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 58719 event pairs, 2380 based on Foata normal form. 140/10644 useless extension candidates. Maximal degree in co-relation 25093. Up to 4594 conditions per place. [2025-03-13 21:46:10,369 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 91 selfloop transitions, 11 changer transitions 0/111 dead transitions. [2025-03-13 21:46:10,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 527 flow [2025-03-13 21:46:10,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:46:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:46:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-03-13 21:46:10,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076388888888888 [2025-03-13 21:46:10,371 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 158 flow. Second operand 6 states and 175 transitions. [2025-03-13 21:46:10,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 527 flow [2025-03-13 21:46:10,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 111 transitions, 513 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-13 21:46:10,376 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 233 flow [2025-03-13 21:46:10,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-03-13 21:46:10,377 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2025-03-13 21:46:10,377 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 233 flow [2025-03-13 21:46:10,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:10,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:10,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:10,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:46:10,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:10,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:10,378 INFO L85 PathProgramCache]: Analyzing trace with hash -307235721, now seen corresponding path program 1 times [2025-03-13 21:46:10,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:10,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091239123] [2025-03-13 21:46:10,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:10,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:10,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:46:10,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:46:10,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:10,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:46:10,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091239123] [2025-03-13 21:46:10,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091239123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:10,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:10,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:46:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639396348] [2025-03-13 21:46:10,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:10,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:46:10,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:10,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:46:10,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:46:10,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-13 21:46:10,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:10,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:10,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-13 21:46:10,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:10,997 INFO L124 PetriNetUnfolderBase]: 6939/9719 cut-off events. [2025-03-13 21:46:10,997 INFO L125 PetriNetUnfolderBase]: For 12459/12459 co-relation queries the response was YES. [2025-03-13 21:46:11,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26951 conditions, 9719 events. 6939/9719 cut-off events. For 12459/12459 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 52105 event pairs, 1361 based on Foata normal form. 128/9781 useless extension candidates. Maximal degree in co-relation 26929. Up to 8052 conditions per place. [2025-03-13 21:46:11,054 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 58 selfloop transitions, 3 changer transitions 3/73 dead transitions. [2025-03-13 21:46:11,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 396 flow [2025-03-13 21:46:11,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:46:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:46:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-03-13 21:46:11,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2025-03-13 21:46:11,055 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 233 flow. Second operand 3 states and 94 transitions. [2025-03-13 21:46:11,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 396 flow [2025-03-13 21:46:11,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 389 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:11,069 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 226 flow [2025-03-13 21:46:11,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-03-13 21:46:11,069 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2025-03-13 21:46:11,070 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 226 flow [2025-03-13 21:46:11,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:11,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:11,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:11,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:46:11,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:11,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:11,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1996026671, now seen corresponding path program 1 times [2025-03-13 21:46:11,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:11,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592133048] [2025-03-13 21:46:11,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:11,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:46:11,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:46:11,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:11,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:11,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:11,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592133048] [2025-03-13 21:46:11,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592133048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:46:11,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363891703] [2025-03-13 21:46:11,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:11,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:11,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:11,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:46:11,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:46:11,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:46:11,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:46:11,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:11,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:11,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-13 21:46:11,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:46:12,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-13 21:46:12,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-13 21:46:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:12,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:46:12,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-03-13 21:46:12,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-03-13 21:46:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:46:12,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363891703] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:46:12,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:46:12,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-13 21:46:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847906467] [2025-03-13 21:46:12,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:46:12,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:46:12,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:12,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:46:12,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:46:12,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-13 21:46:12,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 226 flow. Second operand has 18 states, 18 states have (on average 17.055555555555557) internal successors, (307), 18 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:12,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:12,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-13 21:46:12,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:16,687 INFO L124 PetriNetUnfolderBase]: 34831/49425 cut-off events. [2025-03-13 21:46:16,687 INFO L125 PetriNetUnfolderBase]: For 68394/68394 co-relation queries the response was YES. [2025-03-13 21:46:16,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135014 conditions, 49425 events. 34831/49425 cut-off events. For 68394/68394 co-relation queries the response was YES. Maximal size of possible extension queue 1545. Compared 327351 event pairs, 4146 based on Foata normal form. 426/49670 useless extension candidates. Maximal degree in co-relation 75380. Up to 11426 conditions per place. [2025-03-13 21:46:16,997 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 344 selfloop transitions, 68 changer transitions 24/445 dead transitions. [2025-03-13 21:46:16,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 445 transitions, 2568 flow [2025-03-13 21:46:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-13 21:46:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-13 21:46:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 684 transitions. [2025-03-13 21:46:16,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6195652173913043 [2025-03-13 21:46:16,999 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 226 flow. Second operand 23 states and 684 transitions. [2025-03-13 21:46:16,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 445 transitions, 2568 flow [2025-03-13 21:46:17,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 445 transitions, 2532 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:46:17,102 INFO L231 Difference]: Finished difference. Result has 88 places, 123 transitions, 850 flow [2025-03-13 21:46:17,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=850, PETRI_PLACES=88, PETRI_TRANSITIONS=123} [2025-03-13 21:46:17,103 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2025-03-13 21:46:17,103 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 123 transitions, 850 flow [2025-03-13 21:46:17,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.055555555555557) internal successors, (307), 18 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:17,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:17,104 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:17,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:46:17,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:17,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:17,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:17,309 INFO L85 PathProgramCache]: Analyzing trace with hash 828509554, now seen corresponding path program 1 times [2025-03-13 21:46:17,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:17,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885380632] [2025-03-13 21:46:17,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:17,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:17,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:46:17,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:46:17,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:17,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:46:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885380632] [2025-03-13 21:46:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885380632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:46:18,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984341557] [2025-03-13 21:46:18,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:18,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:46:18,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:46:18,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:46:18,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:46:18,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:46:18,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:46:18,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:18,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:18,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-13 21:46:18,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:46:18,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-03-13 21:46:18,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:46:18,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:46:18,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:46:18,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-03-13 21:46:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:46:18,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984341557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:46:18,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:46:18,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-03-13 21:46:18,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415199318] [2025-03-13 21:46:18,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:46:18,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:46:18,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:18,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:46:18,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:46:18,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-13 21:46:18,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 123 transitions, 850 flow. Second operand has 14 states, 14 states have (on average 18.214285714285715) internal successors, (255), 14 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:18,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:18,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-13 21:46:18,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:25,003 INFO L124 PetriNetUnfolderBase]: 59364/84128 cut-off events. [2025-03-13 21:46:25,004 INFO L125 PetriNetUnfolderBase]: For 203076/203076 co-relation queries the response was YES. [2025-03-13 21:46:25,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256834 conditions, 84128 events. 59364/84128 cut-off events. For 203076/203076 co-relation queries the response was YES. Maximal size of possible extension queue 2694. Compared 593107 event pairs, 7000 based on Foata normal form. 3/83813 useless extension candidates. Maximal degree in co-relation 215738. Up to 29816 conditions per place. [2025-03-13 21:46:25,753 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 235 selfloop transitions, 105 changer transitions 11/360 dead transitions. [2025-03-13 21:46:25,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 360 transitions, 2599 flow [2025-03-13 21:46:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 21:46:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 21:46:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 462 transitions. [2025-03-13 21:46:25,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5661764705882353 [2025-03-13 21:46:25,755 INFO L175 Difference]: Start difference. First operand has 88 places, 123 transitions, 850 flow. Second operand 17 states and 462 transitions. [2025-03-13 21:46:25,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 360 transitions, 2599 flow [2025-03-13 21:46:26,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 360 transitions, 2559 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-03-13 21:46:26,301 INFO L231 Difference]: Finished difference. Result has 110 places, 180 transitions, 1662 flow [2025-03-13 21:46:26,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1662, PETRI_PLACES=110, PETRI_TRANSITIONS=180} [2025-03-13 21:46:26,302 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 60 predicate places. [2025-03-13 21:46:26,302 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 180 transitions, 1662 flow [2025-03-13 21:46:26,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.214285714285715) internal successors, (255), 14 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:26,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:26,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:26,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:46:26,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-13 21:46:26,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:26,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash -110538083, now seen corresponding path program 1 times [2025-03-13 21:46:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:26,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071977004] [2025-03-13 21:46:26,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:26,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-13 21:46:26,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-13 21:46:26,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:26,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:46:26,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:26,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071977004] [2025-03-13 21:46:26,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071977004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:26,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:26,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:46:26,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419988440] [2025-03-13 21:46:26,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:26,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:46:26,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:26,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:46:26,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:46:26,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-13 21:46:26,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 180 transitions, 1662 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:26,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:26,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-13 21:46:26,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:46:36,448 INFO L124 PetriNetUnfolderBase]: 76734/109805 cut-off events. [2025-03-13 21:46:36,449 INFO L125 PetriNetUnfolderBase]: For 486757/486757 co-relation queries the response was YES. [2025-03-13 21:46:37,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366071 conditions, 109805 events. 76734/109805 cut-off events. For 486757/486757 co-relation queries the response was YES. Maximal size of possible extension queue 3461. Compared 815953 event pairs, 27628 based on Foata normal form. 2355/111571 useless extension candidates. Maximal degree in co-relation 360388. Up to 62347 conditions per place. [2025-03-13 21:46:37,411 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 252 selfloop transitions, 8 changer transitions 0/269 dead transitions. [2025-03-13 21:46:37,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 269 transitions, 3185 flow [2025-03-13 21:46:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:46:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:46:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-13 21:46:37,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-13 21:46:37,412 INFO L175 Difference]: Start difference. First operand has 110 places, 180 transitions, 1662 flow. Second operand 3 states and 96 transitions. [2025-03-13 21:46:37,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 269 transitions, 3185 flow [2025-03-13 21:46:39,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 269 transitions, 3040 flow, removed 70 selfloop flow, removed 2 redundant places. [2025-03-13 21:46:39,044 INFO L231 Difference]: Finished difference. Result has 111 places, 181 transitions, 1669 flow [2025-03-13 21:46:39,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1669, PETRI_PLACES=111, PETRI_TRANSITIONS=181} [2025-03-13 21:46:39,045 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 61 predicate places. [2025-03-13 21:46:39,045 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 181 transitions, 1669 flow [2025-03-13 21:46:39,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:39,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:46:39,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:46:39,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:46:39,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-13 21:46:39,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:46:39,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1997478231, now seen corresponding path program 1 times [2025-03-13 21:46:39,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:46:39,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32445688] [2025-03-13 21:46:39,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:46:39,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:46:39,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-13 21:46:39,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-13 21:46:39,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:46:39,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:46:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 21:46:39,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:46:39,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32445688] [2025-03-13 21:46:39,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32445688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:46:39,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:46:39,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:46:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996117807] [2025-03-13 21:46:39,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:46:39,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:46:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:46:39,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:46:39,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:46:39,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48 [2025-03-13 21:46:39,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 181 transitions, 1669 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:46:39,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:46:39,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48 [2025-03-13 21:46:39,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand