./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:02:11,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:02:11,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:02:11,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:02:11,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:02:11,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:02:11,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:02:11,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:02:11,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:02:11,563 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:02:11,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:02:11,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:02:11,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:02:11,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:02:11,566 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:02:11,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:02:11,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:02:11,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:02:11,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:02:11,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:02:11,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:02:11,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:02:11,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:02:11,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:02:11,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:02:11,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:02:11,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:02:11,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:02:11,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:02:11,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:02:11,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:02:11,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:02:11,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:02:11,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:02:11,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:02:11,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:02:11,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:02:11,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:02:11,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:02:11,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:02:11,572 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:02:11,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:02:11,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:02:11,573 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/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/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-06-27 17:02:11,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:02:11,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:02:11,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:02:11,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:02:11,821 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:02:11,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-06-27 17:02:12,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:02:13,080 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:02:13,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-06-27 17:02:13,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684c2ff6f/08a69b5010cf40e484f167956849f62c/FLAG8f799bce2 [2024-06-27 17:02:13,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684c2ff6f/08a69b5010cf40e484f167956849f62c [2024-06-27 17:02:13,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:02:13,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:02:13,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:02:13,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:02:13,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:02:13,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6e6ea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13, skipping insertion in model container [2024-06-27 17:02:13,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,135 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:02:13,255 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2024-06-27 17:02:13,258 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:02:13,264 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:02:13,278 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2024-06-27 17:02:13,279 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:02:13,291 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:02:13,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13 WrapperNode [2024-06-27 17:02:13,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:02:13,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:02:13,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:02:13,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:02:13,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,316 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2024-06-27 17:02:13,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:02:13,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:02:13,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:02:13,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:02:13,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,338 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-06-27 17:02:13,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:02:13,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:02:13,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:02:13,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:02:13,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (1/1) ... [2024-06-27 17:02:13,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:02:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:02:13,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:02:13,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:02:13,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:02:13,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:02:13,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:02:13,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:02:13,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:02:13,427 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 17:02:13,427 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 17:02:13,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:02:13,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:02:13,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:02:13,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:02:13,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:02:13,431 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:02:13,547 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:02:13,550 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:02:13,713 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:02:13,715 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:02:13,802 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:02:13,802 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-06-27 17:02:13,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:02:13 BoogieIcfgContainer [2024-06-27 17:02:13,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:02:13,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:02:13,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:02:13,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:02:13,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:02:13" (1/3) ... [2024-06-27 17:02:13,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1324c832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:02:13, skipping insertion in model container [2024-06-27 17:02:13,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:02:13" (2/3) ... [2024-06-27 17:02:13,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1324c832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:02:13, skipping insertion in model container [2024-06-27 17:02:13,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:02:13" (3/3) ... [2024-06-27 17:02:13,809 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-06-27 17:02:13,815 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:02:13,822 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:02:13,822 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:02:13,822 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:02:13,862 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 17:02:13,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 85 flow [2024-06-27 17:02:13,917 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-06-27 17:02:13,918 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:02:13,920 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-06-27 17:02:13,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 85 flow [2024-06-27 17:02:13,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 74 flow [2024-06-27 17:02:13,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:02:13,942 INFO L357 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, mHoare=true, 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;@6fe0ccb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:02:13,942 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 17:02:13,949 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:02:13,949 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-06-27 17:02:13,949 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:02:13,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:13,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:02:13,950 INFO L420 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-06-27 17:02:13,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:13,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1857037086, now seen corresponding path program 1 times [2024-06-27 17:02:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:13,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415646984] [2024-06-27 17:02:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:14,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:14,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415646984] [2024-06-27 17:02:14,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415646984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:14,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:14,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:02:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162133604] [2024-06-27 17:02:14,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:14,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:02:14,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:14,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:02:14,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:02:14,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-06-27 17:02:14,528 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-06-27 17:02:14,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:14,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-06-27 17:02:14,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:14,688 INFO L124 PetriNetUnfolderBase]: 321/552 cut-off events. [2024-06-27 17:02:14,689 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-06-27 17:02:14,693 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-06-27 17:02:14,698 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 26 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-06-27 17:02:14,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 179 flow [2024-06-27 17:02:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:02:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:02:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-27 17:02:14,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2024-06-27 17:02:14,709 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 74 flow. Second operand 3 states and 74 transitions. [2024-06-27 17:02:14,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 179 flow [2024-06-27 17:02:14,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 17:02:14,716 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 88 flow [2024-06-27 17:02:14,717 INFO L264 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-06-27 17:02:14,720 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2024-06-27 17:02:14,720 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 88 flow [2024-06-27 17:02:14,721 INFO L496 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-06-27 17:02:14,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:14,722 INFO L208 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-06-27 17:02:14,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:02:14,722 INFO L420 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-06-27 17:02:14,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:14,724 INFO L85 PathProgramCache]: Analyzing trace with hash 345968512, now seen corresponding path program 1 times [2024-06-27 17:02:14,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:14,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010610017] [2024-06-27 17:02:14,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:14,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:15,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010610017] [2024-06-27 17:02:15,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010610017] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:15,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:15,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:02:15,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59735563] [2024-06-27 17:02:15,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:15,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:02:15,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:15,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:02:15,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:02:15,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-06-27 17:02:15,033 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-06-27 17:02:15,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:15,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-06-27 17:02:15,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:15,255 INFO L124 PetriNetUnfolderBase]: 577/914 cut-off events. [2024-06-27 17:02:15,255 INFO L125 PetriNetUnfolderBase]: For 198/221 co-relation queries the response was YES. [2024-06-27 17:02:15,257 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-06-27 17:02:15,261 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 62 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2024-06-27 17:02:15,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 84 transitions, 389 flow [2024-06-27 17:02:15,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:02:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:02:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-27 17:02:15,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2024-06-27 17:02:15,266 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 88 flow. Second operand 7 states and 150 transitions. [2024-06-27 17:02:15,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 84 transitions, 389 flow [2024-06-27 17:02:15,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 84 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:02:15,271 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 184 flow [2024-06-27 17:02:15,271 INFO L264 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-06-27 17:02:15,272 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2024-06-27 17:02:15,272 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 184 flow [2024-06-27 17:02:15,273 INFO L496 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-06-27 17:02:15,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:15,273 INFO L208 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-06-27 17:02:15,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:02:15,274 INFO L420 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-06-27 17:02:15,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:15,274 INFO L85 PathProgramCache]: Analyzing trace with hash 160537772, now seen corresponding path program 2 times [2024-06-27 17:02:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:15,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034367771] [2024-06-27 17:02:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:15,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:15,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:15,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034367771] [2024-06-27 17:02:15,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034367771] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:15,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:15,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:02:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423902478] [2024-06-27 17:02:15,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:15,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:02:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:15,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:02:15,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:02:15,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-06-27 17:02:15,492 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-06-27 17:02:15,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:15,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-06-27 17:02:15,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:15,629 INFO L124 PetriNetUnfolderBase]: 698/1103 cut-off events. [2024-06-27 17:02:15,629 INFO L125 PetriNetUnfolderBase]: For 734/804 co-relation queries the response was YES. [2024-06-27 17:02:15,631 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-06-27 17:02:15,635 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 55 selfloop transitions, 21 changer transitions 2/86 dead transitions. [2024-06-27 17:02:15,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 511 flow [2024-06-27 17:02:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:02:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:02:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-06-27 17:02:15,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-06-27 17:02:15,636 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 184 flow. Second operand 7 states and 144 transitions. [2024-06-27 17:02:15,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 511 flow [2024-06-27 17:02:15,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:02:15,639 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 340 flow [2024-06-27 17:02:15,639 INFO L264 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-06-27 17:02:15,640 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2024-06-27 17:02:15,640 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 340 flow [2024-06-27 17:02:15,640 INFO L496 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-06-27 17:02:15,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:15,640 INFO L208 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-06-27 17:02:15,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:02:15,641 INFO L420 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-06-27 17:02:15,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:15,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1462173970, now seen corresponding path program 3 times [2024-06-27 17:02:15,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:15,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105796518] [2024-06-27 17:02:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:15,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:15,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:15,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105796518] [2024-06-27 17:02:15,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105796518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:15,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:15,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:02:15,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518793897] [2024-06-27 17:02:15,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:15,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:02:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:15,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:02:15,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:02:15,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-27 17:02:15,817 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-06-27 17:02:15,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:15,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-27 17:02:15,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:16,086 INFO L124 PetriNetUnfolderBase]: 1472/2215 cut-off events. [2024-06-27 17:02:16,086 INFO L125 PetriNetUnfolderBase]: For 2673/2751 co-relation queries the response was YES. [2024-06-27 17:02:16,090 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-06-27 17:02:16,098 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 88 selfloop transitions, 38 changer transitions 2/135 dead transitions. [2024-06-27 17:02:16,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 135 transitions, 922 flow [2024-06-27 17:02:16,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:02:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:02:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-06-27 17:02:16,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-06-27 17:02:16,102 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 340 flow. Second operand 9 states and 198 transitions. [2024-06-27 17:02:16,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 135 transitions, 922 flow [2024-06-27 17:02:16,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 135 transitions, 878 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 17:02:16,112 INFO L231 Difference]: Finished difference. Result has 64 places, 72 transitions, 584 flow [2024-06-27 17:02:16,112 INFO L264 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-06-27 17:02:16,113 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2024-06-27 17:02:16,114 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 584 flow [2024-06-27 17:02:16,114 INFO L496 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-06-27 17:02:16,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:16,114 INFO L208 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-06-27 17:02:16,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:02:16,115 INFO L420 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-06-27 17:02:16,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1153795878, now seen corresponding path program 4 times [2024-06-27 17:02:16,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:16,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725928957] [2024-06-27 17:02:16,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:16,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:16,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:16,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725928957] [2024-06-27 17:02:16,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725928957] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:16,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:16,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:02:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497019598] [2024-06-27 17:02:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:16,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:02:16,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:16,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:02:16,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:02:16,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-06-27 17:02:16,245 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-06-27 17:02:16,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:16,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-06-27 17:02:16,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:16,507 INFO L124 PetriNetUnfolderBase]: 1361/2148 cut-off events. [2024-06-27 17:02:16,507 INFO L125 PetriNetUnfolderBase]: For 6235/6379 co-relation queries the response was YES. [2024-06-27 17:02:16,513 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-06-27 17:02:16,523 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 65 selfloop transitions, 38 changer transitions 2/114 dead transitions. [2024-06-27 17:02:16,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 114 transitions, 1009 flow [2024-06-27 17:02:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:02:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:02:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-27 17:02:16,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.62109375 [2024-06-27 17:02:16,524 INFO L175 Difference]: Start difference. First operand has 64 places, 72 transitions, 584 flow. Second operand 8 states and 159 transitions. [2024-06-27 17:02:16,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 114 transitions, 1009 flow [2024-06-27 17:02:16,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 114 transitions, 988 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-27 17:02:16,569 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 744 flow [2024-06-27 17:02:16,569 INFO L264 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-06-27 17:02:16,569 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 38 predicate places. [2024-06-27 17:02:16,570 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 744 flow [2024-06-27 17:02:16,570 INFO L496 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-06-27 17:02:16,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:16,570 INFO L208 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-06-27 17:02:16,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:02:16,570 INFO L420 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-06-27 17:02:16,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:16,571 INFO L85 PathProgramCache]: Analyzing trace with hash 973411842, now seen corresponding path program 1 times [2024-06-27 17:02:16,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:16,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316157086] [2024-06-27 17:02:16,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:16,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:16,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316157086] [2024-06-27 17:02:16,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316157086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:16,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:16,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:02:16,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052587269] [2024-06-27 17:02:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:16,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:02:16,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:16,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:02:16,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:02:16,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-27 17:02:16,707 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-06-27 17:02:16,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:16,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-27 17:02:16,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:16,967 INFO L124 PetriNetUnfolderBase]: 1771/2729 cut-off events. [2024-06-27 17:02:16,968 INFO L125 PetriNetUnfolderBase]: For 11307/11489 co-relation queries the response was YES. [2024-06-27 17:02:16,973 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-06-27 17:02:16,985 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 99 selfloop transitions, 29 changer transitions 2/137 dead transitions. [2024-06-27 17:02:16,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 137 transitions, 1372 flow [2024-06-27 17:02:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:02:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:02:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-06-27 17:02:16,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-06-27 17:02:16,987 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 744 flow. Second operand 7 states and 147 transitions. [2024-06-27 17:02:16,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 137 transitions, 1372 flow [2024-06-27 17:02:17,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 137 transitions, 1296 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-27 17:02:17,010 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 818 flow [2024-06-27 17:02:17,010 INFO L264 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-06-27 17:02:17,012 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2024-06-27 17:02:17,013 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 818 flow [2024-06-27 17:02:17,013 INFO L496 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-06-27 17:02:17,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:17,013 INFO L208 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-06-27 17:02:17,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:02:17,013 INFO L420 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-06-27 17:02:17,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1572373122, now seen corresponding path program 2 times [2024-06-27 17:02:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:17,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902631406] [2024-06-27 17:02:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:17,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:17,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:17,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902631406] [2024-06-27 17:02:17,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902631406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:17,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:17,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:02:17,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067707393] [2024-06-27 17:02:17,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:17,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:02:17,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:17,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:02:17,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:02:17,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 17:02:17,288 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-06-27 17:02:17,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:17,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 17:02:17,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:17,698 INFO L124 PetriNetUnfolderBase]: 2084/3285 cut-off events. [2024-06-27 17:02:17,698 INFO L125 PetriNetUnfolderBase]: For 15846/16039 co-relation queries the response was YES. [2024-06-27 17:02:17,755 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-06-27 17:02:17,771 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 90 selfloop transitions, 42 changer transitions 0/143 dead transitions. [2024-06-27 17:02:17,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 143 transitions, 1488 flow [2024-06-27 17:02:17,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:02:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:02:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-27 17:02:17,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.60546875 [2024-06-27 17:02:17,772 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 818 flow. Second operand 8 states and 155 transitions. [2024-06-27 17:02:17,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 143 transitions, 1488 flow [2024-06-27 17:02:17,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 143 transitions, 1438 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-06-27 17:02:17,803 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 1161 flow [2024-06-27 17:02:17,803 INFO L264 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-06-27 17:02:17,804 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 54 predicate places. [2024-06-27 17:02:17,804 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 1161 flow [2024-06-27 17:02:17,804 INFO L496 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-06-27 17:02:17,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:17,804 INFO L208 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-06-27 17:02:17,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:02:17,805 INFO L420 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-06-27 17:02:17,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1236423898, now seen corresponding path program 1 times [2024-06-27 17:02:17,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:17,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190116030] [2024-06-27 17:02:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:17,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:17,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:17,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:17,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190116030] [2024-06-27 17:02:17,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190116030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:17,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:17,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:02:17,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459087675] [2024-06-27 17:02:17,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:17,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:02:17,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:17,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:02:17,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:02:18,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 17:02:18,006 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-06-27 17:02:18,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:18,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 17:02:18,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:18,490 INFO L124 PetriNetUnfolderBase]: 2574/4145 cut-off events. [2024-06-27 17:02:18,491 INFO L125 PetriNetUnfolderBase]: For 22140/22452 co-relation queries the response was YES. [2024-06-27 17:02:18,501 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-06-27 17:02:18,521 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 79 selfloop transitions, 50 changer transitions 3/145 dead transitions. [2024-06-27 17:02:18,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 145 transitions, 1645 flow [2024-06-27 17:02:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:02:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:02:18,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-06-27 17:02:18,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-06-27 17:02:18,523 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 1161 flow. Second operand 5 states and 108 transitions. [2024-06-27 17:02:18,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 145 transitions, 1645 flow [2024-06-27 17:02:18,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 145 transitions, 1612 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-06-27 17:02:18,577 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 1336 flow [2024-06-27 17:02:18,577 INFO L264 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-06-27 17:02:18,579 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2024-06-27 17:02:18,580 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 1336 flow [2024-06-27 17:02:18,580 INFO L496 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-06-27 17:02:18,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:18,580 INFO L208 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-06-27 17:02:18,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:02:18,580 INFO L420 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-06-27 17:02:18,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash -719485854, now seen corresponding path program 2 times [2024-06-27 17:02:18,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:18,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302122494] [2024-06-27 17:02:18,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:18,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:18,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:18,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302122494] [2024-06-27 17:02:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302122494] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:02:18,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34358126] [2024-06-27 17:02:18,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:02:18,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:02:18,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:02:18,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:02:18,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 17:02:18,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:02:18,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:02:18,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:02:18,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:02:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:19,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:02:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:19,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34358126] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:02:19,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:02:19,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2024-06-27 17:02:19,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469684013] [2024-06-27 17:02:19,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:02:19,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:02:19,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:19,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:02:19,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:02:19,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-27 17:02:19,320 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-06-27 17:02:19,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:19,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-27 17:02:19,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:22,433 INFO L124 PetriNetUnfolderBase]: 9862/15103 cut-off events. [2024-06-27 17:02:22,434 INFO L125 PetriNetUnfolderBase]: For 98728/98728 co-relation queries the response was YES. [2024-06-27 17:02:22,525 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-06-27 17:02:22,596 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 347 selfloop transitions, 261 changer transitions 31/643 dead transitions. [2024-06-27 17:02:22,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 643 transitions, 6589 flow [2024-06-27 17:02:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-06-27 17:02:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-06-27 17:02:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 734 transitions. [2024-06-27 17:02:22,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6371527777777778 [2024-06-27 17:02:22,599 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 1336 flow. Second operand 36 states and 734 transitions. [2024-06-27 17:02:22,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 643 transitions, 6589 flow [2024-06-27 17:02:22,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 643 transitions, 6278 flow, removed 90 selfloop flow, removed 1 redundant places. [2024-06-27 17:02:22,923 INFO L231 Difference]: Finished difference. Result has 161 places, 320 transitions, 4783 flow [2024-06-27 17:02:22,923 INFO L264 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-06-27 17:02:22,924 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 126 predicate places. [2024-06-27 17:02:22,924 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 320 transitions, 4783 flow [2024-06-27 17:02:22,924 INFO L496 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-06-27 17:02:22,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:22,924 INFO L208 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-06-27 17:02:22,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 17:02:23,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:02:23,135 INFO L420 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-06-27 17:02:23,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:23,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1949446178, now seen corresponding path program 3 times [2024-06-27 17:02:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:23,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092549281] [2024-06-27 17:02:23,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:23,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:23,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-06-27 17:02:23,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092549281] [2024-06-27 17:02:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092549281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:23,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:23,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:02:23,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951223648] [2024-06-27 17:02:23,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:23,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:02:23,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:23,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:02:23,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:02:23,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 17:02:23,302 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-06-27 17:02:23,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:23,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 17:02:23,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:24,136 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-06-27 17:02:24,137 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-27 17:02:24,137 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 17:02:24,137 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 17:02:24,137 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 17:02:24,413 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-06-27 17:02:24,414 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-27 17:02:24,414 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 17:02:24,414 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 17:02:24,415 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 17:02:24,415 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-27 17:02:25,293 INFO L124 PetriNetUnfolderBase]: 7914/12751 cut-off events. [2024-06-27 17:02:25,294 INFO L125 PetriNetUnfolderBase]: For 209407/211141 co-relation queries the response was YES. [2024-06-27 17:02:25,347 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-06-27 17:02:25,398 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 168 selfloop transitions, 191 changer transitions 9/411 dead transitions. [2024-06-27 17:02:25,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 411 transitions, 6670 flow [2024-06-27 17:02:25,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:02:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:02:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-06-27 17:02:25,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-06-27 17:02:25,400 INFO L175 Difference]: Start difference. First operand has 161 places, 320 transitions, 4783 flow. Second operand 6 states and 124 transitions. [2024-06-27 17:02:25,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 411 transitions, 6670 flow [2024-06-27 17:02:26,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 411 transitions, 6174 flow, removed 237 selfloop flow, removed 2 redundant places. [2024-06-27 17:02:26,213 INFO L231 Difference]: Finished difference. Result has 166 places, 346 transitions, 5259 flow [2024-06-27 17:02:26,213 INFO L264 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-06-27 17:02:26,213 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 131 predicate places. [2024-06-27 17:02:26,213 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 346 transitions, 5259 flow [2024-06-27 17:02:26,214 INFO L496 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-06-27 17:02:26,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:26,214 INFO L208 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-06-27 17:02:26,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:02:26,214 INFO L420 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-06-27 17:02:26,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash 692878188, now seen corresponding path program 3 times [2024-06-27 17:02:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205669056] [2024-06-27 17:02:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:26,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205669056] [2024-06-27 17:02:26,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205669056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:26,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:26,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:02:26,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929218074] [2024-06-27 17:02:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:26,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:02:26,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:26,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:02:26,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:02:26,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-06-27 17:02:26,305 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-06-27 17:02:26,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:26,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-06-27 17:02:26,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:27,766 INFO L124 PetriNetUnfolderBase]: 6325/10290 cut-off events. [2024-06-27 17:02:27,766 INFO L125 PetriNetUnfolderBase]: For 175012/176893 co-relation queries the response was YES. [2024-06-27 17:02:27,820 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-06-27 17:02:27,989 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 273 selfloop transitions, 43 changer transitions 10/384 dead transitions. [2024-06-27 17:02:27,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 384 transitions, 6249 flow [2024-06-27 17:02:27,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:02:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:02:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-06-27 17:02:27,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-06-27 17:02:27,991 INFO L175 Difference]: Start difference. First operand has 166 places, 346 transitions, 5259 flow. Second operand 5 states and 108 transitions. [2024-06-27 17:02:27,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 384 transitions, 6249 flow [2024-06-27 17:02:28,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 384 transitions, 6213 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-06-27 17:02:28,487 INFO L231 Difference]: Finished difference. Result has 170 places, 338 transitions, 5182 flow [2024-06-27 17:02:28,487 INFO L264 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-06-27 17:02:28,488 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 135 predicate places. [2024-06-27 17:02:28,488 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 338 transitions, 5182 flow [2024-06-27 17:02:28,488 INFO L496 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-06-27 17:02:28,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:28,488 INFO L208 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-06-27 17:02:28,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 17:02:28,488 INFO L420 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-06-27 17:02:28,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1330784062, now seen corresponding path program 4 times [2024-06-27 17:02:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:28,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545533597] [2024-06-27 17:02:28,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:28,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:28,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:28,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545533597] [2024-06-27 17:02:28,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545533597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:28,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:28,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:02:28,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902497681] [2024-06-27 17:02:28,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:28,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:02:28,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:28,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:02:28,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:02:28,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 17:02:28,626 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-06-27 17:02:28,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:28,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 17:02:28,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:30,630 INFO L124 PetriNetUnfolderBase]: 8340/13153 cut-off events. [2024-06-27 17:02:30,630 INFO L125 PetriNetUnfolderBase]: For 223818/225570 co-relation queries the response was YES. [2024-06-27 17:02:30,701 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-06-27 17:02:30,767 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 311 selfloop transitions, 242 changer transitions 10/606 dead transitions. [2024-06-27 17:02:30,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 606 transitions, 10076 flow [2024-06-27 17:02:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:02:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:02:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-06-27 17:02:30,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6614583333333334 [2024-06-27 17:02:30,771 INFO L175 Difference]: Start difference. First operand has 170 places, 338 transitions, 5182 flow. Second operand 6 states and 127 transitions. [2024-06-27 17:02:30,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 606 transitions, 10076 flow [2024-06-27 17:02:31,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 606 transitions, 9984 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-27 17:02:31,643 INFO L231 Difference]: Finished difference. Result has 176 places, 463 transitions, 8123 flow [2024-06-27 17:02:31,643 INFO L264 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-06-27 17:02:31,644 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 141 predicate places. [2024-06-27 17:02:31,644 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 463 transitions, 8123 flow [2024-06-27 17:02:31,644 INFO L496 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-06-27 17:02:31,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:31,644 INFO L208 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-06-27 17:02:31,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 17:02:31,645 INFO L420 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-06-27 17:02:31,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:31,645 INFO L85 PathProgramCache]: Analyzing trace with hash 361780620, now seen corresponding path program 5 times [2024-06-27 17:02:31,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:31,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196967470] [2024-06-27 17:02:31,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:31,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:31,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:31,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:31,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196967470] [2024-06-27 17:02:31,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196967470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:31,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:31,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:02:31,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803539705] [2024-06-27 17:02:31,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:31,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:02:31,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:31,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:02:31,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:02:31,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 17:02:31,741 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-06-27 17:02:31,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:31,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 17:02:31,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:35,079 INFO L124 PetriNetUnfolderBase]: 12586/19501 cut-off events. [2024-06-27 17:02:35,079 INFO L125 PetriNetUnfolderBase]: For 409724/412380 co-relation queries the response was YES. [2024-06-27 17:02:35,176 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-06-27 17:02:35,262 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 492 selfloop transitions, 471 changer transitions 9/1015 dead transitions. [2024-06-27 17:02:35,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 1015 transitions, 19204 flow [2024-06-27 17:02:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:02:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:02:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-27 17:02:35,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2024-06-27 17:02:35,264 INFO L175 Difference]: Start difference. First operand has 176 places, 463 transitions, 8123 flow. Second operand 9 states and 177 transitions. [2024-06-27 17:02:35,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 1015 transitions, 19204 flow [2024-06-27 17:02:36,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 1015 transitions, 19174 flow, removed 15 selfloop flow, removed 0 redundant places. [2024-06-27 17:02:36,763 INFO L231 Difference]: Finished difference. Result has 191 places, 765 transitions, 15749 flow [2024-06-27 17:02:36,763 INFO L264 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-06-27 17:02:36,764 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 156 predicate places. [2024-06-27 17:02:36,764 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 765 transitions, 15749 flow [2024-06-27 17:02:36,764 INFO L496 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-06-27 17:02:36,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:36,764 INFO L208 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-06-27 17:02:36,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 17:02:36,765 INFO L420 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-06-27 17:02:36,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:36,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1401496852, now seen corresponding path program 6 times [2024-06-27 17:02:36,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:36,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601547687] [2024-06-27 17:02:36,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:36,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:36,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:36,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601547687] [2024-06-27 17:02:36,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601547687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:36,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:36,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:02:36,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259323773] [2024-06-27 17:02:36,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:36,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:02:36,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:36,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:02:36,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:02:36,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-27 17:02:36,882 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-06-27 17:02:36,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:36,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-27 17:02:36,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:41,535 INFO L124 PetriNetUnfolderBase]: 16226/24186 cut-off events. [2024-06-27 17:02:41,536 INFO L125 PetriNetUnfolderBase]: For 578961/581192 co-relation queries the response was YES. [2024-06-27 17:02:41,773 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-06-27 17:02:41,912 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 379 selfloop transitions, 664 changer transitions 9/1078 dead transitions. [2024-06-27 17:02:41,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 1078 transitions, 23232 flow [2024-06-27 17:02:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:02:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:02:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-27 17:02:41,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6517857142857143 [2024-06-27 17:02:41,913 INFO L175 Difference]: Start difference. First operand has 191 places, 765 transitions, 15749 flow. Second operand 7 states and 146 transitions. [2024-06-27 17:02:41,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 1078 transitions, 23232 flow [2024-06-27 17:02:45,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1078 transitions, 22559 flow, removed 145 selfloop flow, removed 4 redundant places. [2024-06-27 17:02:45,150 INFO L231 Difference]: Finished difference. Result has 197 places, 933 transitions, 20859 flow [2024-06-27 17:02:45,151 INFO L264 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-06-27 17:02:45,151 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 162 predicate places. [2024-06-27 17:02:45,152 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 933 transitions, 20859 flow [2024-06-27 17:02:45,152 INFO L496 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-06-27 17:02:45,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:02:45,152 INFO L208 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-06-27 17:02:45,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 17:02:45,152 INFO L420 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-06-27 17:02:45,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:02:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1473556504, now seen corresponding path program 7 times [2024-06-27 17:02:45,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:02:45,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734582510] [2024-06-27 17:02:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:02:45,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:02:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:02:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:02:45,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:02:45,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734582510] [2024-06-27 17:02:45,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734582510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:02:45,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:02:45,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:02:45,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158949001] [2024-06-27 17:02:45,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:02:45,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:02:45,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:02:45,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:02:45,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:02:45,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 32 [2024-06-27 17:02:45,246 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-06-27 17:02:45,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:02:45,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 32 [2024-06-27 17:02:45,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:02:50,749 INFO L124 PetriNetUnfolderBase]: 14501/22203 cut-off events. [2024-06-27 17:02:50,749 INFO L125 PetriNetUnfolderBase]: For 538294/540847 co-relation queries the response was YES. [2024-06-27 17:02:50,955 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-06-27 17:02:51,097 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 440 selfloop transitions, 59 changer transitions 2/961 dead transitions. [2024-06-27 17:02:51,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 961 transitions, 22161 flow [2024-06-27 17:02:51,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:02:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:02:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-06-27 17:02:51,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.64375 [2024-06-27 17:02:51,098 INFO L175 Difference]: Start difference. First operand has 197 places, 933 transitions, 20859 flow. Second operand 5 states and 103 transitions. [2024-06-27 17:02:51,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 961 transitions, 22161 flow