./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:34:45,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:34:45,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:34:45,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:34:45,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:34:45,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:34:45,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:34:45,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:34:45,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:34:45,505 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:34:45,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:34:45,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:34:45,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:34:45,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:34:45,507 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:34:45,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:34:45,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:34:45,508 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:34:45,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:34:45,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:34:45,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:34:45,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:34:45,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:34:45,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:34:45,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:34:45,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:34:45,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:34:45,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:34:45,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:34:45,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:34:45,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:34:45,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:34:45,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:34:45,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:34:45,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:34:45,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:34:45,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:34:45,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:34:45,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:34:45,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:34:45,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:34:45,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:34:45,517 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2024-10-11 14:34:45,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:34:45,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:34:45,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:34:45,788 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:34:45,789 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:34:45,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-10-11 14:34:47,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:34:47,212 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:34:47,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-10-11 14:34:47,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/438d85e31/599172bfcc9d49bcb49ba8dd3271055b/FLAG041a462f0 [2024-10-11 14:34:47,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/438d85e31/599172bfcc9d49bcb49ba8dd3271055b [2024-10-11 14:34:47,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:34:47,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:34:47,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:34:47,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:34:47,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:34:47,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ea1871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47, skipping insertion in model container [2024-10-11 14:34:47,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:34:47,807 WARN L248 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-mult-equiv.wvr.c[2630,2643] [2024-10-11 14:34:47,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:34:47,820 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:34:47,835 WARN L248 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-mult-equiv.wvr.c[2630,2643] [2024-10-11 14:34:47,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:34:47,849 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:34:47,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47 WrapperNode [2024-10-11 14:34:47,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:34:47,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:34:47,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:34:47,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:34:47,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,878 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2024-10-11 14:34:47,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:34:47,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:34:47,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:34:47,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:34:47,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,897 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]. [2024-10-11 14:34:47,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:34:47,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:34:47,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:34:47,916 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:34:47,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (1/1) ... [2024-10-11 14:34:47,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:34:47,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:34:47,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:34:47,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:34:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:34:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 14:34:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 14:34:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 14:34:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 14:34:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 14:34:47,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 14:34:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:34:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:34:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:34:47,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:34:47,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:34:48,000 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:34:48,124 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:34:48,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:34:48,297 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:34:48,298 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:34:48,391 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:34:48,391 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 14:34:48,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:34:48 BoogieIcfgContainer [2024-10-11 14:34:48,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:34:48,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:34:48,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:34:48,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:34:48,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:34:47" (1/3) ... [2024-10-11 14:34:48,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:34:48, skipping insertion in model container [2024-10-11 14:34:48,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:34:47" (2/3) ... [2024-10-11 14:34:48,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:34:48, skipping insertion in model container [2024-10-11 14:34:48,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:34:48" (3/3) ... [2024-10-11 14:34:48,398 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-10-11 14:34:48,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:34:48,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:34:48,412 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:34:48,463 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 14:34:48,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 85 flow [2024-10-11 14:34:48,521 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-10-11 14:34:48,521 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:34:48,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-10-11 14:34:48,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 85 flow [2024-10-11 14:34:48,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 74 flow [2024-10-11 14:34:48,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:34:48,542 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;@1742053a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:34:48,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 14:34:48,550 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:34:48,550 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-10-11 14:34:48,550 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:34:48,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:34:48,551 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:34:48,551 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 1 more)] === [2024-10-11 14:34:48,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:34:48,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1857037086, now seen corresponding path program 1 times [2024-10-11 14:34:48,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:34:48,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964333154] [2024-10-11 14:34:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:34:48,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:34:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:34:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:49,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:34:49,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964333154] [2024-10-11 14:34:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964333154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:34:49,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:34:49,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:34:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459491834] [2024-10-11 14:34:49,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:34:49,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:34:49,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:34:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:34:49,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:34:49,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-10-11 14:34:49,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:34:49,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:34:49,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-10-11 14:34:49,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:34:49,364 INFO L124 PetriNetUnfolderBase]: 321/552 cut-off events. [2024-10-11 14:34:49,364 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-11 14:34:49,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 552 events. 321/552 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2475 event pairs, 34 based on Foata normal form. 1/536 useless extension candidates. Maximal degree in co-relation 896. Up to 376 conditions per place. [2024-10-11 14:34:49,378 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 26 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-10-11 14:34:49,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 179 flow [2024-10-11 14:34:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:34:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:34:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-10-11 14:34:49,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2024-10-11 14:34:49,392 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 74 flow. Second operand 3 states and 74 transitions. [2024-10-11 14:34:49,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 179 flow [2024-10-11 14:34:49,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 14:34:49,400 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 88 flow [2024-10-11 14:34:49,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2024-10-11 14:34:49,406 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2024-10-11 14:34:49,406 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 88 flow [2024-10-11 14:34:49,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:34:49,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:34:49,407 INFO L204 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] [2024-10-11 14:34:49,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:34:49,410 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 1 more)] === [2024-10-11 14:34:49,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:34:49,410 INFO L85 PathProgramCache]: Analyzing trace with hash 345968512, now seen corresponding path program 1 times [2024-10-11 14:34:49,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:34:49,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751750989] [2024-10-11 14:34:49,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:34:49,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:34:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:34:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:49,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:34:49,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751750989] [2024-10-11 14:34:49,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751750989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:34:49,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:34:49,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:34:49,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338352230] [2024-10-11 14:34:49,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:34:49,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:34:49,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:34:49,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:34:49,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:34:49,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-10-11 14:34:49,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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) [2024-10-11 14:34:49,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:34:49,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-10-11 14:34:49,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:34:50,029 INFO L124 PetriNetUnfolderBase]: 577/914 cut-off events. [2024-10-11 14:34:50,030 INFO L125 PetriNetUnfolderBase]: For 198/221 co-relation queries the response was YES. [2024-10-11 14:34:50,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 914 events. 577/914 cut-off events. For 198/221 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4362 event pairs, 20 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 619. Up to 436 conditions per place. [2024-10-11 14:34:50,040 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 62 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2024-10-11 14:34:50,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 84 transitions, 389 flow [2024-10-11 14:34:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:34:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 14:34:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-10-11 14:34:50,042 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2024-10-11 14:34:50,042 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 88 flow. Second operand 7 states and 150 transitions. [2024-10-11 14:34:50,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 84 transitions, 389 flow [2024-10-11 14:34:50,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 84 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:34:50,046 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 184 flow [2024-10-11 14:34:50,047 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2024-10-11 14:34:50,048 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2024-10-11 14:34:50,048 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 184 flow [2024-10-11 14:34:50,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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) [2024-10-11 14:34:50,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:34:50,049 INFO L204 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] [2024-10-11 14:34:50,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:34:50,050 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 1 more)] === [2024-10-11 14:34:50,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:34:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash 160537772, now seen corresponding path program 2 times [2024-10-11 14:34:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:34:50,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694700562] [2024-10-11 14:34:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:34:50,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:34:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:34:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:50,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:34:50,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694700562] [2024-10-11 14:34:50,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694700562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:34:50,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:34:50,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:34:50,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307829176] [2024-10-11 14:34:50,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:34:50,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:34:50,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:34:50,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:34:50,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:34:50,308 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-10-11 14:34:50,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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) [2024-10-11 14:34:50,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:34:50,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-10-11 14:34:50,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:34:50,491 INFO L124 PetriNetUnfolderBase]: 698/1103 cut-off events. [2024-10-11 14:34:50,491 INFO L125 PetriNetUnfolderBase]: For 734/804 co-relation queries the response was YES. [2024-10-11 14:34:50,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 1103 events. 698/1103 cut-off events. For 734/804 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5450 event pairs, 78 based on Foata normal form. 31/1088 useless extension candidates. Maximal degree in co-relation 2785. Up to 713 conditions per place. [2024-10-11 14:34:50,500 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 55 selfloop transitions, 21 changer transitions 2/86 dead transitions. [2024-10-11 14:34:50,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 511 flow [2024-10-11 14:34:50,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:34:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 14:34:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-10-11 14:34:50,503 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-10-11 14:34:50,504 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 184 flow. Second operand 7 states and 144 transitions. [2024-10-11 14:34:50,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 511 flow [2024-10-11 14:34:50,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:34:50,510 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 340 flow [2024-10-11 14:34:50,511 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2024-10-11 14:34:50,512 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2024-10-11 14:34:50,512 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 340 flow [2024-10-11 14:34:50,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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) [2024-10-11 14:34:50,512 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:34:50,512 INFO L204 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] [2024-10-11 14:34:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:34:50,513 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 1 more)] === [2024-10-11 14:34:50,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:34:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1462173970, now seen corresponding path program 3 times [2024-10-11 14:34:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:34:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690283283] [2024-10-11 14:34:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:34:50,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:34:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:34:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:50,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:34:50,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690283283] [2024-10-11 14:34:50,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690283283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:34:50,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:34:50,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:34:50,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116238956] [2024-10-11 14:34:50,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:34:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:34:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:34:50,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:34:50,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:34:50,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-10-11 14:34:50,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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) [2024-10-11 14:34:50,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:34:50,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-10-11 14:34:50,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:34:51,106 INFO L124 PetriNetUnfolderBase]: 1472/2215 cut-off events. [2024-10-11 14:34:51,107 INFO L125 PetriNetUnfolderBase]: For 2673/2751 co-relation queries the response was YES. [2024-10-11 14:34:51,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6970 conditions, 2215 events. 1472/2215 cut-off events. For 2673/2751 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 11761 event pairs, 120 based on Foata normal form. 37/2204 useless extension candidates. Maximal degree in co-relation 5295. Up to 915 conditions per place. [2024-10-11 14:34:51,120 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 88 selfloop transitions, 38 changer transitions 2/135 dead transitions. [2024-10-11 14:34:51,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 135 transitions, 922 flow [2024-10-11 14:34:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:34:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:34:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-10-11 14:34:51,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-10-11 14:34:51,122 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 340 flow. Second operand 9 states and 198 transitions. [2024-10-11 14:34:51,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 135 transitions, 922 flow [2024-10-11 14:34:51,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 135 transitions, 878 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-11 14:34:51,130 INFO L231 Difference]: Finished difference. Result has 64 places, 72 transitions, 584 flow [2024-10-11 14:34:51,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=584, PETRI_PLACES=64, PETRI_TRANSITIONS=72} [2024-10-11 14:34:51,130 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2024-10-11 14:34:51,130 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 584 flow [2024-10-11 14:34:51,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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) [2024-10-11 14:34:51,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:34:51,131 INFO L204 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] [2024-10-11 14:34:51,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:34:51,131 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 1 more)] === [2024-10-11 14:34:51,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:34:51,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1153795878, now seen corresponding path program 4 times [2024-10-11 14:34:51,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:34:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122879405] [2024-10-11 14:34:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:34:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:34:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:34:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:51,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:34:51,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122879405] [2024-10-11 14:34:51,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122879405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:34:51,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:34:51,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:34:51,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720254593] [2024-10-11 14:34:51,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:34:51,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:34:51,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:34:51,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:34:51,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:34:51,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-10-11 14:34:51,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 72 transitions, 584 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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) [2024-10-11 14:34:51,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:34:51,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-10-11 14:34:51,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:34:51,537 INFO L124 PetriNetUnfolderBase]: 1361/2148 cut-off events. [2024-10-11 14:34:51,537 INFO L125 PetriNetUnfolderBase]: For 6235/6379 co-relation queries the response was YES. [2024-10-11 14:34:51,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8276 conditions, 2148 events. 1361/2148 cut-off events. For 6235/6379 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 12175 event pairs, 141 based on Foata normal form. 38/2128 useless extension candidates. Maximal degree in co-relation 6477. Up to 1240 conditions per place. [2024-10-11 14:34:51,551 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 65 selfloop transitions, 38 changer transitions 2/114 dead transitions. [2024-10-11 14:34:51,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 114 transitions, 1009 flow [2024-10-11 14:34:51,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:34:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:34:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-10-11 14:34:51,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.62109375 [2024-10-11 14:34:51,553 INFO L175 Difference]: Start difference. First operand has 64 places, 72 transitions, 584 flow. Second operand 8 states and 159 transitions. [2024-10-11 14:34:51,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 114 transitions, 1009 flow [2024-10-11 14:34:51,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 114 transitions, 988 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-11 14:34:51,567 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 744 flow [2024-10-11 14:34:51,567 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=744, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2024-10-11 14:34:51,568 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2024-10-11 14:34:51,568 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 744 flow [2024-10-11 14:34:51,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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) [2024-10-11 14:34:51,568 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:34:51,568 INFO L204 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] [2024-10-11 14:34:51,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:34:51,569 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 1 more)] === [2024-10-11 14:34:51,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:34:51,569 INFO L85 PathProgramCache]: Analyzing trace with hash 973411842, now seen corresponding path program 1 times [2024-10-11 14:34:51,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:34:51,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498807764] [2024-10-11 14:34:51,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:34:51,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:34:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:34:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:51,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:34:51,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498807764] [2024-10-11 14:34:51,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498807764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:34:51,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:34:51,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:34:51,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340736665] [2024-10-11 14:34:51,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:34:51,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:34:51,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:34:51,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:34:51,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:34:51,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-10-11 14:34:51,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 744 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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) [2024-10-11 14:34:51,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:34:51,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-10-11 14:34:51,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:34:52,074 INFO L124 PetriNetUnfolderBase]: 1771/2729 cut-off events. [2024-10-11 14:34:52,075 INFO L125 PetriNetUnfolderBase]: For 11307/11489 co-relation queries the response was YES. [2024-10-11 14:34:52,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11684 conditions, 2729 events. 1771/2729 cut-off events. For 11307/11489 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 15506 event pairs, 186 based on Foata normal form. 49/2728 useless extension candidates. Maximal degree in co-relation 9058. Up to 1448 conditions per place. [2024-10-11 14:34:52,094 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 99 selfloop transitions, 29 changer transitions 2/137 dead transitions. [2024-10-11 14:34:52,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 137 transitions, 1372 flow [2024-10-11 14:34:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:34:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 14:34:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-10-11 14:34:52,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-10-11 14:34:52,096 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 744 flow. Second operand 7 states and 147 transitions. [2024-10-11 14:34:52,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 137 transitions, 1372 flow [2024-10-11 14:34:52,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 137 transitions, 1296 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-10-11 14:34:52,121 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 818 flow [2024-10-11 14:34:52,121 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=818, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2024-10-11 14:34:52,122 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2024-10-11 14:34:52,122 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 818 flow [2024-10-11 14:34:52,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 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) [2024-10-11 14:34:52,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:34:52,122 INFO L204 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] [2024-10-11 14:34:52,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:34:52,123 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 1 more)] === [2024-10-11 14:34:52,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:34:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1572373122, now seen corresponding path program 2 times [2024-10-11 14:34:52,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:34:52,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001119622] [2024-10-11 14:34:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:34:52,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:34:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:34:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:34:52,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001119622] [2024-10-11 14:34:52,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001119622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:34:52,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:34:52,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:34:52,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413225036] [2024-10-11 14:34:52,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:34:52,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:34:52,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:34:52,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:34:52,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:34:52,395 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:34:52,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 818 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) [2024-10-11 14:34:52,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:34:52,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:34:52,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:34:52,811 INFO L124 PetriNetUnfolderBase]: 2084/3285 cut-off events. [2024-10-11 14:34:52,812 INFO L125 PetriNetUnfolderBase]: For 15846/16039 co-relation queries the response was YES. [2024-10-11 14:34:52,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14132 conditions, 3285 events. 2084/3285 cut-off events. For 15846/16039 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 18582 event pairs, 414 based on Foata normal form. 21/3274 useless extension candidates. Maximal degree in co-relation 11177. Up to 2730 conditions per place. [2024-10-11 14:34:52,836 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 90 selfloop transitions, 42 changer transitions 0/143 dead transitions. [2024-10-11 14:34:52,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 143 transitions, 1488 flow [2024-10-11 14:34:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:34:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:34:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-10-11 14:34:52,838 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.60546875 [2024-10-11 14:34:52,838 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 818 flow. Second operand 8 states and 155 transitions. [2024-10-11 14:34:52,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 143 transitions, 1488 flow [2024-10-11 14:34:52,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 143 transitions, 1438 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-10-11 14:34:52,869 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 1161 flow [2024-10-11 14:34:52,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1161, PETRI_PLACES=89, PETRI_TRANSITIONS=101} [2024-10-11 14:34:52,870 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 54 predicate places. [2024-10-11 14:34:52,870 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 1161 flow [2024-10-11 14:34:52,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) [2024-10-11 14:34:52,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:34:52,870 INFO L204 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] [2024-10-11 14:34:52,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:34:52,870 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 1 more)] === [2024-10-11 14:34:52,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:34:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1236423898, now seen corresponding path program 1 times [2024-10-11 14:34:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:34:52,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794504701] [2024-10-11 14:34:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:34:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:34:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:34:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:53,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:34:53,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794504701] [2024-10-11 14:34:53,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794504701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:34:53,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:34:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:34:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942641972] [2024-10-11 14:34:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:34:53,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:34:53,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:34:53,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:34:53,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:34:53,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:34:53,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 1161 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-10-11 14:34:53,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:34:53,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:34:53,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:34:53,436 INFO L124 PetriNetUnfolderBase]: 2574/4145 cut-off events. [2024-10-11 14:34:53,436 INFO L125 PetriNetUnfolderBase]: For 22140/22452 co-relation queries the response was YES. [2024-10-11 14:34:53,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18371 conditions, 4145 events. 2574/4145 cut-off events. For 22140/22452 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 25224 event pairs, 828 based on Foata normal form. 1/3821 useless extension candidates. Maximal degree in co-relation 15944. Up to 2349 conditions per place. [2024-10-11 14:34:53,517 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 79 selfloop transitions, 50 changer transitions 3/145 dead transitions. [2024-10-11 14:34:53,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 145 transitions, 1645 flow [2024-10-11 14:34:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:34:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:34:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-10-11 14:34:53,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-10-11 14:34:53,520 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 1161 flow. Second operand 5 states and 108 transitions. [2024-10-11 14:34:53,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 145 transitions, 1645 flow [2024-10-11 14:34:53,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 145 transitions, 1612 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-10-11 14:34:53,586 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 1336 flow [2024-10-11 14:34:53,586 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1336, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2024-10-11 14:34:53,587 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2024-10-11 14:34:53,587 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 1336 flow [2024-10-11 14:34:53,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-10-11 14:34:53,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:34:53,587 INFO L204 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] [2024-10-11 14:34:53,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:34:53,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:34:53,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:34:53,590 INFO L85 PathProgramCache]: Analyzing trace with hash -719485854, now seen corresponding path program 2 times [2024-10-11 14:34:53,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:34:53,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211430186] [2024-10-11 14:34:53,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:34:53,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:34:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:34:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:53,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:34:53,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211430186] [2024-10-11 14:34:53,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211430186] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:34:53,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382143404] [2024-10-11 14:34:53,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:34:53,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:34:53,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:34:53,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:34:53,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:34:53,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:34:53,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:34:53,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 14:34:53,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:34:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:54,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:34:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:54,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382143404] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:34:54,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:34:54,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-10-11 14:34:54,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135058248] [2024-10-11 14:34:54,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:34:54,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:34:54,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:34:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:34:54,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:34:54,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-10-11 14:34:54,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 1336 flow. Second operand has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 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) [2024-10-11 14:34:54,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:34:54,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-10-11 14:34:54,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:34:57,794 INFO L124 PetriNetUnfolderBase]: 9862/15103 cut-off events. [2024-10-11 14:34:57,795 INFO L125 PetriNetUnfolderBase]: For 98728/98728 co-relation queries the response was YES. [2024-10-11 14:34:57,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71033 conditions, 15103 events. 9862/15103 cut-off events. For 98728/98728 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 99259 event pairs, 609 based on Foata normal form. 315/15417 useless extension candidates. Maximal degree in co-relation 62555. Up to 3457 conditions per place. [2024-10-11 14:34:57,907 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 347 selfloop transitions, 261 changer transitions 31/643 dead transitions. [2024-10-11 14:34:57,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 643 transitions, 6589 flow [2024-10-11 14:34:57,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 14:34:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-10-11 14:34:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 734 transitions. [2024-10-11 14:34:57,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6371527777777778 [2024-10-11 14:34:57,916 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 1336 flow. Second operand 36 states and 734 transitions. [2024-10-11 14:34:57,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 643 transitions, 6589 flow [2024-10-11 14:34:58,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 643 transitions, 6278 flow, removed 90 selfloop flow, removed 1 redundant places. [2024-10-11 14:34:58,270 INFO L231 Difference]: Finished difference. Result has 161 places, 320 transitions, 4783 flow [2024-10-11 14:34:58,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=4783, PETRI_PLACES=161, PETRI_TRANSITIONS=320} [2024-10-11 14:34:58,271 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 126 predicate places. [2024-10-11 14:34:58,271 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 320 transitions, 4783 flow [2024-10-11 14:34:58,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 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) [2024-10-11 14:34:58,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:34:58,271 INFO L204 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] [2024-10-11 14:34:58,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 14:34:58,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:34:58,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:34:58,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:34:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1949446178, now seen corresponding path program 3 times [2024-10-11 14:34:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:34:58,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909377572] [2024-10-11 14:34:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:34:58,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:34:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:34:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:34:58,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:34:58,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909377572] [2024-10-11 14:34:58,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909377572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:34:58,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:34:58,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:34:58,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760875970] [2024-10-11 14:34:58,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:34:58,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:34:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:34:58,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:34:58,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:34:58,644 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:34:58,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 320 transitions, 4783 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-10-11 14:34:58,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:34:58,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:34:58,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:34:59,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([241] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][184], [Black: 340#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 313#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 342#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 131#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 123#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 129#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 125#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), 155#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 145#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 138#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 142#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), 46#true, 387#true, Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 116#true, 27#L80true, 25#L100true, Black: 49#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 53#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 48#(= ~N~0 ~L~0), 76#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 65#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 60#(= ~N~0 ~L~0), Black: 63#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 62#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 109#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 75#(or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 78#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 80#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 71#true, 19#L69true, Black: 350#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 338#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 96#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 322#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 100#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 308#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 154#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 95#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 153#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 348#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 305#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 354#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 318#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 330#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 326#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 106#(= ~N~0 ~L~0), Black: 104#true, Black: 336#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 107#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 316#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 269#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 352#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 320#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 328#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 344#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 311#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 150#true, Black: 346#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L50true, Black: 324#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 334#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 303#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 332#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 301#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2024-10-11 14:34:59,577 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-10-11 14:34:59,577 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-11 14:34:59,577 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-11 14:34:59,577 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-11 14:34:59,812 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([241] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][184], [Black: 340#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 313#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 342#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 131#(and (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 123#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 129#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 125#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), 155#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 145#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 138#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 142#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), 46#true, 387#true, Black: 44#(and (= ~p~0 0) (= ~q~0 0)), 116#true, 27#L80true, 25#L100true, Black: 49#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 53#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), 76#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 48#(= ~N~0 ~L~0), Black: 65#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 60#(= ~N~0 ~L~0), Black: 63#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 62#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 109#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 75#(or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 78#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 80#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 71#true, 19#L69true, Black: 350#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 338#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 96#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 322#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 308#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= ~N~0 ~L~0) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 100#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 154#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 95#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 153#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 152#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 348#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 305#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 354#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 318#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 330#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 326#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 106#(= ~N~0 ~L~0), Black: 336#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 104#true, Black: 316#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 107#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 269#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 352#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 320#(and (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 328#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0)), Black: 344#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0)), Black: 311#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296)))), Black: 150#true, Black: 346#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 13#L50true, Black: 324#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2)) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 334#(and (or (< 0 (mod ~L~0 4294967296)) (forall ((~M~0 Int)) (= (mod ~M~0 2147483648) 0)) (< (mod ~N~0 4294967296) 2)) (= ~p~0 0) (= ~q~0 0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 303#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 332#(and (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= 2 (mod ~L~0 4294967296)) (= (mod ~p~0 2) 0)) (= ~p~0 0)) (= thread1Thread1of1ForFork1_~cond~0 1) (= ~q~0 0) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) 0)) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 301#(and (or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))]) [2024-10-11 14:34:59,812 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-10-11 14:34:59,813 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-11 14:34:59,813 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-11 14:34:59,813 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-11 14:34:59,813 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-11 14:35:00,705 INFO L124 PetriNetUnfolderBase]: 7914/12751 cut-off events. [2024-10-11 14:35:00,705 INFO L125 PetriNetUnfolderBase]: For 209407/211141 co-relation queries the response was YES. [2024-10-11 14:35:00,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88069 conditions, 12751 events. 7914/12751 cut-off events. For 209407/211141 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 90162 event pairs, 2306 based on Foata normal form. 412/12844 useless extension candidates. Maximal degree in co-relation 85637. Up to 6885 conditions per place. [2024-10-11 14:35:00,844 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 168 selfloop transitions, 191 changer transitions 9/411 dead transitions. [2024-10-11 14:35:00,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 411 transitions, 6670 flow [2024-10-11 14:35:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:35:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:35:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-10-11 14:35:00,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-10-11 14:35:00,845 INFO L175 Difference]: Start difference. First operand has 161 places, 320 transitions, 4783 flow. Second operand 6 states and 124 transitions. [2024-10-11 14:35:00,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 411 transitions, 6670 flow [2024-10-11 14:35:01,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 411 transitions, 6174 flow, removed 237 selfloop flow, removed 2 redundant places. [2024-10-11 14:35:01,820 INFO L231 Difference]: Finished difference. Result has 166 places, 346 transitions, 5259 flow [2024-10-11 14:35:01,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4262, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5259, PETRI_PLACES=166, PETRI_TRANSITIONS=346} [2024-10-11 14:35:01,822 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 131 predicate places. [2024-10-11 14:35:01,822 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 346 transitions, 5259 flow [2024-10-11 14:35:01,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-10-11 14:35:01,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:35:01,823 INFO L204 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] [2024-10-11 14:35:01,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:35:01,823 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:35:01,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:35:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash 692878188, now seen corresponding path program 3 times [2024-10-11 14:35:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:35:01,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95677124] [2024-10-11 14:35:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:35:01,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:35:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:35:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:35:01,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:35:01,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95677124] [2024-10-11 14:35:01,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95677124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:35:01,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:35:01,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:35:01,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361771485] [2024-10-11 14:35:01,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:35:01,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:35:01,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:35:01,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:35:01,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:35:01,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-10-11 14:35:01,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 346 transitions, 5259 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-11 14:35:01,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:35:01,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-10-11 14:35:01,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:35:03,567 INFO L124 PetriNetUnfolderBase]: 6325/10290 cut-off events. [2024-10-11 14:35:03,568 INFO L125 PetriNetUnfolderBase]: For 175012/176893 co-relation queries the response was YES. [2024-10-11 14:35:03,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70551 conditions, 10290 events. 6325/10290 cut-off events. For 175012/176893 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 72687 event pairs, 1034 based on Foata normal form. 360/10340 useless extension candidates. Maximal degree in co-relation 68874. Up to 8044 conditions per place. [2024-10-11 14:35:03,663 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 273 selfloop transitions, 43 changer transitions 10/384 dead transitions. [2024-10-11 14:35:03,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 384 transitions, 6249 flow [2024-10-11 14:35:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:35:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:35:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-10-11 14:35:03,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-10-11 14:35:03,666 INFO L175 Difference]: Start difference. First operand has 166 places, 346 transitions, 5259 flow. Second operand 5 states and 108 transitions. [2024-10-11 14:35:03,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 384 transitions, 6249 flow [2024-10-11 14:35:04,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 384 transitions, 6213 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-10-11 14:35:04,286 INFO L231 Difference]: Finished difference. Result has 170 places, 338 transitions, 5182 flow [2024-10-11 14:35:04,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5083, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5182, PETRI_PLACES=170, PETRI_TRANSITIONS=338} [2024-10-11 14:35:04,287 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 135 predicate places. [2024-10-11 14:35:04,287 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 338 transitions, 5182 flow [2024-10-11 14:35:04,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-11 14:35:04,288 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:35:04,288 INFO L204 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] [2024-10-11 14:35:04,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:35:04,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:35:04,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:35:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1330784062, now seen corresponding path program 4 times [2024-10-11 14:35:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:35:04,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239681294] [2024-10-11 14:35:04,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:35:04,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:35:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:35:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:35:04,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:35:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239681294] [2024-10-11 14:35:04,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239681294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:35:04,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:35:04,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:35:04,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269318586] [2024-10-11 14:35:04,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:35:04,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:35:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:35:04,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:35:04,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:35:04,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:35:04,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 338 transitions, 5182 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-10-11 14:35:04,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:35:04,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:35:04,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:35:06,676 INFO L124 PetriNetUnfolderBase]: 8340/13153 cut-off events. [2024-10-11 14:35:06,676 INFO L125 PetriNetUnfolderBase]: For 223818/225570 co-relation queries the response was YES. [2024-10-11 14:35:06,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90409 conditions, 13153 events. 8340/13153 cut-off events. For 223818/225570 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 92157 event pairs, 1139 based on Foata normal form. 679/13584 useless extension candidates. Maximal degree in co-relation 88309. Up to 4461 conditions per place. [2024-10-11 14:35:06,800 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 311 selfloop transitions, 242 changer transitions 10/606 dead transitions. [2024-10-11 14:35:06,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 606 transitions, 10076 flow [2024-10-11 14:35:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:35:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:35:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-10-11 14:35:06,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2024-10-11 14:35:06,802 INFO L175 Difference]: Start difference. First operand has 170 places, 338 transitions, 5182 flow. Second operand 6 states and 127 transitions. [2024-10-11 14:35:06,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 606 transitions, 10076 flow [2024-10-11 14:35:07,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 606 transitions, 9984 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-10-11 14:35:07,725 INFO L231 Difference]: Finished difference. Result has 176 places, 463 transitions, 8123 flow [2024-10-11 14:35:07,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5121, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8123, PETRI_PLACES=176, PETRI_TRANSITIONS=463} [2024-10-11 14:35:07,726 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 141 predicate places. [2024-10-11 14:35:07,727 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 463 transitions, 8123 flow [2024-10-11 14:35:07,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) [2024-10-11 14:35:07,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:35:07,727 INFO L204 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] [2024-10-11 14:35:07,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:35:07,727 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:35:07,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:35:07,728 INFO L85 PathProgramCache]: Analyzing trace with hash 361780620, now seen corresponding path program 5 times [2024-10-11 14:35:07,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:35:07,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813505139] [2024-10-11 14:35:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:35:07,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:35:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:35:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:35:07,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:35:07,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813505139] [2024-10-11 14:35:07,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813505139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:35:07,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:35:07,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:35:07,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086614502] [2024-10-11 14:35:07,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:35:07,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:35:07,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:35:07,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:35:07,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:35:07,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-10-11 14:35:07,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 463 transitions, 8123 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) [2024-10-11 14:35:07,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:35:07,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-10-11 14:35:07,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:35:11,453 INFO L124 PetriNetUnfolderBase]: 12586/19501 cut-off events. [2024-10-11 14:35:11,453 INFO L125 PetriNetUnfolderBase]: For 409724/412380 co-relation queries the response was YES. [2024-10-11 14:35:11,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148391 conditions, 19501 events. 12586/19501 cut-off events. For 409724/412380 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 140493 event pairs, 1562 based on Foata normal form. 1082/20266 useless extension candidates. Maximal degree in co-relation 145495. Up to 6070 conditions per place. [2024-10-11 14:35:11,701 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 492 selfloop transitions, 471 changer transitions 9/1015 dead transitions. [2024-10-11 14:35:11,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 1015 transitions, 19204 flow [2024-10-11 14:35:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:35:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:35:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-10-11 14:35:11,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2024-10-11 14:35:11,703 INFO L175 Difference]: Start difference. First operand has 176 places, 463 transitions, 8123 flow. Second operand 9 states and 177 transitions. [2024-10-11 14:35:11,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 1015 transitions, 19204 flow [2024-10-11 14:35:13,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 1015 transitions, 19174 flow, removed 15 selfloop flow, removed 0 redundant places. [2024-10-11 14:35:13,303 INFO L231 Difference]: Finished difference. Result has 191 places, 765 transitions, 15749 flow [2024-10-11 14:35:13,303 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8107, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15749, PETRI_PLACES=191, PETRI_TRANSITIONS=765} [2024-10-11 14:35:13,304 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 156 predicate places. [2024-10-11 14:35:13,304 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 765 transitions, 15749 flow [2024-10-11 14:35:13,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) [2024-10-11 14:35:13,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:35:13,304 INFO L204 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] [2024-10-11 14:35:13,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:35:13,304 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:35:13,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:35:13,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1401496852, now seen corresponding path program 6 times [2024-10-11 14:35:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:35:13,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378067984] [2024-10-11 14:35:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:35:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:35:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:35:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:35:13,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:35:13,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378067984] [2024-10-11 14:35:13,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378067984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:35:13,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:35:13,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:35:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147401379] [2024-10-11 14:35:13,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:35:13,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:35:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:35:13,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:35:13,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:35:13,465 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-10-11 14:35:13,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 765 transitions, 15749 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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) [2024-10-11 14:35:13,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:35:13,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-10-11 14:35:13,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:35:18,503 INFO L124 PetriNetUnfolderBase]: 16226/24186 cut-off events. [2024-10-11 14:35:18,504 INFO L125 PetriNetUnfolderBase]: For 578961/581192 co-relation queries the response was YES. [2024-10-11 14:35:18,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201172 conditions, 24186 events. 16226/24186 cut-off events. For 578961/581192 co-relation queries the response was YES. Maximal size of possible extension queue 1424. Compared 166046 event pairs, 1660 based on Foata normal form. 1147/25088 useless extension candidates. Maximal degree in co-relation 198565. Up to 7569 conditions per place. [2024-10-11 14:35:18,850 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 379 selfloop transitions, 664 changer transitions 9/1078 dead transitions. [2024-10-11 14:35:18,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 1078 transitions, 23232 flow [2024-10-11 14:35:18,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:35:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 14:35:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-10-11 14:35:18,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6517857142857143 [2024-10-11 14:35:18,851 INFO L175 Difference]: Start difference. First operand has 191 places, 765 transitions, 15749 flow. Second operand 7 states and 146 transitions. [2024-10-11 14:35:18,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 1078 transitions, 23232 flow [2024-10-11 14:35:21,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1078 transitions, 22559 flow, removed 145 selfloop flow, removed 4 redundant places. [2024-10-11 14:35:21,808 INFO L231 Difference]: Finished difference. Result has 197 places, 933 transitions, 20859 flow [2024-10-11 14:35:21,809 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=15068, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=498, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=20859, PETRI_PLACES=197, PETRI_TRANSITIONS=933} [2024-10-11 14:35:21,809 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 162 predicate places. [2024-10-11 14:35:21,809 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 933 transitions, 20859 flow [2024-10-11 14:35:21,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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) [2024-10-11 14:35:21,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:35:21,810 INFO L204 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] [2024-10-11 14:35:21,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:35:21,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:35:21,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:35:21,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1473556504, now seen corresponding path program 7 times [2024-10-11 14:35:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:35:21,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876147452] [2024-10-11 14:35:21,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:35:21,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:35:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:35:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:35:21,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:35:21,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876147452] [2024-10-11 14:35:21,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876147452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:35:21,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:35:21,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:35:21,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785806984] [2024-10-11 14:35:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:35:21,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:35:21,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:35:21,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:35:21,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:35:21,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-10-11 14:35:21,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 933 transitions, 20859 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-11 14:35:21,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:35:21,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-10-11 14:35:21,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:35:27,004 INFO L124 PetriNetUnfolderBase]: 14501/22203 cut-off events. [2024-10-11 14:35:27,005 INFO L125 PetriNetUnfolderBase]: For 538294/540847 co-relation queries the response was YES. [2024-10-11 14:35:27,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187745 conditions, 22203 events. 14501/22203 cut-off events. For 538294/540847 co-relation queries the response was YES. Maximal size of possible extension queue 1404. Compared 158404 event pairs, 1446 based on Foata normal form. 720/22597 useless extension candidates. Maximal degree in co-relation 183399. Up to 17209 conditions per place. [2024-10-11 14:35:27,301 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 440 selfloop transitions, 59 changer transitions 2/961 dead transitions. [2024-10-11 14:35:27,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 961 transitions, 22161 flow [2024-10-11 14:35:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:35:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:35:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-10-11 14:35:27,302 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.64375 [2024-10-11 14:35:27,303 INFO L175 Difference]: Start difference. First operand has 197 places, 933 transitions, 20859 flow. Second operand 5 states and 103 transitions. [2024-10-11 14:35:27,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 961 transitions, 22161 flow [2024-10-11 14:35:30,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 961 transitions, 21690 flow, removed 102 selfloop flow, removed 8 redundant places. [2024-10-11 14:35:30,111 INFO L231 Difference]: Finished difference. Result has 194 places, 933 transitions, 20548 flow [2024-10-11 14:35:30,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=20337, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=871, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20548, PETRI_PLACES=194, PETRI_TRANSITIONS=933} [2024-10-11 14:35:30,114 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 159 predicate places. [2024-10-11 14:35:30,114 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 933 transitions, 20548 flow [2024-10-11 14:35:30,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-11 14:35:30,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:35:30,114 INFO L204 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] [2024-10-11 14:35:30,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 14:35:30,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:35:30,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:35:30,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1400754928, now seen corresponding path program 8 times [2024-10-11 14:35:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:35:30,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561356228] [2024-10-11 14:35:30,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:35:30,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:35:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:35:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:35:30,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:35:30,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561356228] [2024-10-11 14:35:30,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561356228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:35:30,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:35:30,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:35:30,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110090243] [2024-10-11 14:35:30,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:35:30,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:35:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:35:30,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:35:30,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:35:30,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-10-11 14:35:30,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 933 transitions, 20548 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-11 14:35:30,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:35:30,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-10-11 14:35:30,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:35:35,349 INFO L124 PetriNetUnfolderBase]: 14517/22236 cut-off events. [2024-10-11 14:35:35,349 INFO L125 PetriNetUnfolderBase]: For 499946/502329 co-relation queries the response was YES. [2024-10-11 14:35:35,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183919 conditions, 22236 events. 14517/22236 cut-off events. For 499946/502329 co-relation queries the response was YES. Maximal size of possible extension queue 1413. Compared 158762 event pairs, 1419 based on Foata normal form. 660/22611 useless extension candidates. Maximal degree in co-relation 179510. Up to 17265 conditions per place. [2024-10-11 14:35:35,626 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 427 selfloop transitions, 68 changer transitions 1/956 dead transitions. [2024-10-11 14:35:35,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 956 transitions, 21769 flow [2024-10-11 14:35:35,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:35:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:35:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-10-11 14:35:35,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.61875 [2024-10-11 14:35:35,627 INFO L175 Difference]: Start difference. First operand has 194 places, 933 transitions, 20548 flow. Second operand 5 states and 99 transitions. [2024-10-11 14:35:35,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 956 transitions, 21769 flow [2024-10-11 14:35:37,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 956 transitions, 21575 flow, removed 35 selfloop flow, removed 2 redundant places. [2024-10-11 14:35:38,006 INFO L231 Difference]: Finished difference. Result has 198 places, 941 transitions, 20732 flow [2024-10-11 14:35:38,007 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=20367, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=871, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20732, PETRI_PLACES=198, PETRI_TRANSITIONS=941} [2024-10-11 14:35:38,007 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 163 predicate places. [2024-10-11 14:35:38,008 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 941 transitions, 20732 flow [2024-10-11 14:35:38,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-11 14:35:38,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:35:38,008 INFO L204 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] [2024-10-11 14:35:38,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 14:35:38,008 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:35:38,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:35:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash 255642964, now seen corresponding path program 9 times [2024-10-11 14:35:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:35:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566885430] [2024-10-11 14:35:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:35:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:35:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:35:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:35:38,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:35:38,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566885430] [2024-10-11 14:35:38,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566885430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:35:38,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:35:38,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:35:38,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132748718] [2024-10-11 14:35:38,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:35:38,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:35:38,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:35:38,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:35:38,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:35:38,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-10-11 14:35:38,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 941 transitions, 20732 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-11 14:35:38,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:35:38,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-10-11 14:35:38,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:35:43,202 INFO L124 PetriNetUnfolderBase]: 14729/22671 cut-off events. [2024-10-11 14:35:43,202 INFO L125 PetriNetUnfolderBase]: For 514164/516445 co-relation queries the response was YES. [2024-10-11 14:35:43,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187766 conditions, 22671 events. 14729/22671 cut-off events. For 514164/516445 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 163758 event pairs, 1461 based on Foata normal form. 598/22966 useless extension candidates. Maximal degree in co-relation 183315. Up to 17086 conditions per place. [2024-10-11 14:35:43,501 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 465 selfloop transitions, 74 changer transitions 4/1000 dead transitions. [2024-10-11 14:35:43,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 1000 transitions, 22587 flow [2024-10-11 14:35:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:35:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:35:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-10-11 14:35:43,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.640625 [2024-10-11 14:35:43,502 INFO L175 Difference]: Start difference. First operand has 198 places, 941 transitions, 20732 flow. Second operand 6 states and 123 transitions. [2024-10-11 14:35:43,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 1000 transitions, 22587 flow [2024-10-11 14:35:46,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 1000 transitions, 22467 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-10-11 14:35:46,113 INFO L231 Difference]: Finished difference. Result has 197 places, 943 transitions, 20842 flow [2024-10-11 14:35:46,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=20454, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=20842, PETRI_PLACES=197, PETRI_TRANSITIONS=943} [2024-10-11 14:35:46,114 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 162 predicate places. [2024-10-11 14:35:46,114 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 943 transitions, 20842 flow [2024-10-11 14:35:46,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-10-11 14:35:46,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:35:46,114 INFO L204 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] [2024-10-11 14:35:46,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 14:35:46,115 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:35:46,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:35:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1216697434, now seen corresponding path program 1 times [2024-10-11 14:35:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:35:46,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566124299] [2024-10-11 14:35:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:35:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:35:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:35:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:35:46,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:35:46,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566124299] [2024-10-11 14:35:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566124299] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:35:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093678611] [2024-10-11 14:35:46,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:35:46,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:35:46,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:35:46,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:35:46,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:35:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:35:46,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 14:35:46,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:35:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:35:46,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:35:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:35:46,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093678611] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:35:46,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:35:46,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-10-11 14:35:46,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631264487] [2024-10-11 14:35:46,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:35:46,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:35:46,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:35:46,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:35:46,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:35:46,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-10-11 14:35:46,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 943 transitions, 20842 flow. Second operand has 13 states, 13 states have (on average 16.384615384615383) internal successors, (213), 13 states have internal predecessors, (213), 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) [2024-10-11 14:35:46,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:35:46,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-10-11 14:35:46,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:35:54,945 INFO L124 PetriNetUnfolderBase]: 21446/34574 cut-off events. [2024-10-11 14:35:54,945 INFO L125 PetriNetUnfolderBase]: For 766808/772433 co-relation queries the response was YES. [2024-10-11 14:35:55,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288472 conditions, 34574 events. 21446/34574 cut-off events. For 766808/772433 co-relation queries the response was YES. Maximal size of possible extension queue 2517. Compared 286725 event pairs, 653 based on Foata normal form. 2889/37111 useless extension candidates. Maximal degree in co-relation 284862. Up to 11959 conditions per place. [2024-10-11 14:35:55,455 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 332 selfloop transitions, 855 changer transitions 8/1670 dead transitions. [2024-10-11 14:35:55,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 1670 transitions, 35522 flow [2024-10-11 14:35:55,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 14:35:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-11 14:35:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 322 transitions. [2024-10-11 14:35:55,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-10-11 14:35:55,457 INFO L175 Difference]: Start difference. First operand has 197 places, 943 transitions, 20842 flow. Second operand 14 states and 322 transitions. [2024-10-11 14:35:55,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 1670 transitions, 35522 flow