/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 20:03:03,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 20:03:03,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 20:03:03,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 20:03:03,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 20:03:03,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 20:03:03,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 20:03:03,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 20:03:03,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 20:03:03,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 20:03:03,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 20:03:03,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 20:03:03,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 20:03:03,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 20:03:03,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 20:03:03,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 20:03:03,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 20:03:03,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 20:03:03,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 20:03:03,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 20:03:03,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 20:03:03,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 20:03:03,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 20:03:03,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 20:03:03,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 20:03:03,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 20:03:03,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 20:03:03,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 20:03:03,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 20:03:03,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 20:03:03,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 20:03:03,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 20:03:03,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 20:03:03,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 20:03:03,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 20:03:03,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 20:03:03,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 20:03:03,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 20:03:03,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 20:03:03,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 20:03:03,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 20:03:03,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 20:03:03,167 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 20:03:03,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 20:03:03,168 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 20:03:03,168 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 20:03:03,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 20:03:03,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 20:03:03,169 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 20:03:03,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 20:03:03,169 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 20:03:03,169 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 20:03:03,169 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 20:03:03,169 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 20:03:03,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 20:03:03,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 20:03:03,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 20:03:03,170 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 20:03:03,170 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 20:03:03,170 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 20:03:03,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 20:03:03,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 20:03:03,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 20:03:03,170 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 20:03:03,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 20:03:03,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:03:03,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 20:03:03,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 20:03:03,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 20:03:03,171 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 20:03:03,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 20:03:03,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 20:03:03,171 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 20:03:03,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-11 20:03:03,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 20:03:03,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 20:03:03,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 20:03:03,458 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 20:03:03,458 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 20:03:03,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2022-12-11 20:03:04,464 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 20:03:04,660 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 20:03:04,660 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2022-12-11 20:03:04,667 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7cbd954/d7d12df17f8246c7b39169fa21c0a4c8/FLAG9648bdfb6 [2022-12-11 20:03:04,681 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7cbd954/d7d12df17f8246c7b39169fa21c0a4c8 [2022-12-11 20:03:04,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 20:03:04,684 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 20:03:04,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 20:03:04,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 20:03:04,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 20:03:04,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b93201b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04, skipping insertion in model container [2022-12-11 20:03:04,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 20:03:04,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 20:03:04,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,849 WARN L237 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[2591,2604] [2022-12-11 20:03:04,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:03:04,863 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 20:03:04,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:03:04,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:03:04,894 WARN L237 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[2591,2604] [2022-12-11 20:03:04,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:03:04,906 INFO L208 MainTranslator]: Completed translation [2022-12-11 20:03:04,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04 WrapperNode [2022-12-11 20:03:04,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 20:03:04,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 20:03:04,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 20:03:04,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 20:03:04,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,942 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2022-12-11 20:03:04,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 20:03:04,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 20:03:04,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 20:03:04,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 20:03:04,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,969 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 20:03:04,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 20:03:04,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 20:03:04,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 20:03:04,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (1/1) ... [2022-12-11 20:03:04,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:03:04,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:03:04,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 20:03:05,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 20:03:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 20:03:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 20:03:05,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 20:03:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 20:03:05,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 20:03:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-11 20:03:05,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-11 20:03:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 20:03:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 20:03:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 20:03:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 20:03:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 20:03:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 20:03:05,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 20:03:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 20:03:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 20:03:05,028 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 20:03:05,111 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 20:03:05,112 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 20:03:05,342 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 20:03:05,396 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 20:03:05,396 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-11 20:03:05,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:03:05 BoogieIcfgContainer [2022-12-11 20:03:05,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 20:03:05,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 20:03:05,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 20:03:05,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 20:03:05,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 08:03:04" (1/3) ... [2022-12-11 20:03:05,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d2a8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:03:05, skipping insertion in model container [2022-12-11 20:03:05,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:03:04" (2/3) ... [2022-12-11 20:03:05,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d2a8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:03:05, skipping insertion in model container [2022-12-11 20:03:05,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:03:05" (3/3) ... [2022-12-11 20:03:05,409 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2022-12-11 20:03:05,421 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 20:03:05,421 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 20:03:05,421 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 20:03:05,475 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-11 20:03:05,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 92 transitions, 208 flow [2022-12-11 20:03:05,534 INFO L130 PetriNetUnfolder]: 7/89 cut-off events. [2022-12-11 20:03:05,534 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 20:03:05,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 89 events. 7/89 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-12-11 20:03:05,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 92 transitions, 208 flow [2022-12-11 20:03:05,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 79 transitions, 176 flow [2022-12-11 20:03:05,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 20:03:05,552 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@368b5a67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 20:03:05,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-11 20:03:05,569 INFO L130 PetriNetUnfolder]: 7/78 cut-off events. [2022-12-11 20:03:05,570 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 20:03:05,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:05,570 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:05,571 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)] === [2022-12-11 20:03:05,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:05,575 INFO L85 PathProgramCache]: Analyzing trace with hash 181303589, now seen corresponding path program 1 times [2022-12-11 20:03:05,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:05,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565747092] [2022-12-11 20:03:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:06,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:06,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565747092] [2022-12-11 20:03:06,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565747092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:06,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:06,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:03:06,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228951128] [2022-12-11 20:03:06,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:06,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:03:06,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:06,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:03:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:03:06,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 92 [2022-12-11 20:03:06,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 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) [2022-12-11 20:03:06,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:06,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 92 [2022-12-11 20:03:06,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:06,451 INFO L130 PetriNetUnfolder]: 34/188 cut-off events. [2022-12-11 20:03:06,451 INFO L131 PetriNetUnfolder]: For 44/46 co-relation queries the response was YES. [2022-12-11 20:03:06,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 188 events. 34/188 cut-off events. For 44/46 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 473 event pairs, 0 based on Foata normal form. 40/210 useless extension candidates. Maximal degree in co-relation 162. Up to 45 conditions per place. [2022-12-11 20:03:06,455 INFO L137 encePairwiseOnDemand]: 79/92 looper letters, 25 selfloop transitions, 7 changer transitions 7/98 dead transitions. [2022-12-11 20:03:06,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 98 transitions, 316 flow [2022-12-11 20:03:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 20:03:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 20:03:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 620 transitions. [2022-12-11 20:03:06,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.842391304347826 [2022-12-11 20:03:06,473 INFO L175 Difference]: Start difference. First operand has 82 places, 79 transitions, 176 flow. Second operand 8 states and 620 transitions. [2022-12-11 20:03:06,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 98 transitions, 316 flow [2022-12-11 20:03:06,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 98 transitions, 288 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-11 20:03:06,483 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 194 flow [2022-12-11 20:03:06,485 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=194, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2022-12-11 20:03:06,488 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 4 predicate places. [2022-12-11 20:03:06,488 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 194 flow [2022-12-11 20:03:06,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.0) internal successors, (438), 6 states have internal predecessors, (438), 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) [2022-12-11 20:03:06,489 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:06,489 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:06,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 20:03:06,490 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)] === [2022-12-11 20:03:06,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:06,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1512929224, now seen corresponding path program 1 times [2022-12-11 20:03:06,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:06,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252444591] [2022-12-11 20:03:06,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:06,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:06,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:06,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252444591] [2022-12-11 20:03:06,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252444591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:06,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:06,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 20:03:06,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003621560] [2022-12-11 20:03:06,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:06,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 20:03:06,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:06,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 20:03:06,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 20:03:06,737 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2022-12-11 20:03:06,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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) [2022-12-11 20:03:06,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:06,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2022-12-11 20:03:06,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:06,918 INFO L130 PetriNetUnfolder]: 358/839 cut-off events. [2022-12-11 20:03:06,918 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-11 20:03:06,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 839 events. 358/839 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4489 event pairs, 93 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 1640. Up to 359 conditions per place. [2022-12-11 20:03:06,927 INFO L137 encePairwiseOnDemand]: 84/92 looper letters, 48 selfloop transitions, 12 changer transitions 1/114 dead transitions. [2022-12-11 20:03:06,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 114 transitions, 418 flow [2022-12-11 20:03:06,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 20:03:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 20:03:06,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 455 transitions. [2022-12-11 20:03:06,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8242753623188406 [2022-12-11 20:03:06,929 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 194 flow. Second operand 6 states and 455 transitions. [2022-12-11 20:03:06,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 114 transitions, 418 flow [2022-12-11 20:03:06,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 114 transitions, 414 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-11 20:03:06,936 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 272 flow [2022-12-11 20:03:06,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2022-12-11 20:03:06,936 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 6 predicate places. [2022-12-11 20:03:06,936 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 272 flow [2022-12-11 20:03:06,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.2) internal successors, (346), 5 states have internal predecessors, (346), 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) [2022-12-11 20:03:06,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:06,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:06,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 20:03:06,937 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)] === [2022-12-11 20:03:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash 377268426, now seen corresponding path program 2 times [2022-12-11 20:03:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:06,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592381840] [2022-12-11 20:03:06,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:07,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592381840] [2022-12-11 20:03:07,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592381840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:07,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:07,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:03:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483128059] [2022-12-11 20:03:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:07,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:03:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:07,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:03:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:03:07,204 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2022-12-11 20:03:07,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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) [2022-12-11 20:03:07,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:07,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2022-12-11 20:03:07,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:07,391 INFO L130 PetriNetUnfolder]: 380/975 cut-off events. [2022-12-11 20:03:07,392 INFO L131 PetriNetUnfolder]: For 413/417 co-relation queries the response was YES. [2022-12-11 20:03:07,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 975 events. 380/975 cut-off events. For 413/417 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5742 event pairs, 73 based on Foata normal form. 15/928 useless extension candidates. Maximal degree in co-relation 1045. Up to 328 conditions per place. [2022-12-11 20:03:07,397 INFO L137 encePairwiseOnDemand]: 81/92 looper letters, 61 selfloop transitions, 23 changer transitions 0/137 dead transitions. [2022-12-11 20:03:07,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 137 transitions, 644 flow [2022-12-11 20:03:07,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 20:03:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 20:03:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 530 transitions. [2022-12-11 20:03:07,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8229813664596274 [2022-12-11 20:03:07,399 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 272 flow. Second operand 7 states and 530 transitions. [2022-12-11 20:03:07,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 137 transitions, 644 flow [2022-12-11 20:03:07,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 137 transitions, 611 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 20:03:07,403 INFO L231 Difference]: Finished difference. Result has 96 places, 101 transitions, 418 flow [2022-12-11 20:03:07,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=418, PETRI_PLACES=96, PETRI_TRANSITIONS=101} [2022-12-11 20:03:07,404 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 14 predicate places. [2022-12-11 20:03:07,404 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 101 transitions, 418 flow [2022-12-11 20:03:07,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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) [2022-12-11 20:03:07,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:07,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:07,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 20:03:07,405 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)] === [2022-12-11 20:03:07,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:07,405 INFO L85 PathProgramCache]: Analyzing trace with hash -674790770, now seen corresponding path program 3 times [2022-12-11 20:03:07,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:07,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122710187] [2022-12-11 20:03:07,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:07,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:07,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:07,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122710187] [2022-12-11 20:03:07,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122710187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:07,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:07,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:03:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250035644] [2022-12-11 20:03:07,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:07,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:03:07,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:07,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:03:07,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:03:07,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2022-12-11 20:03:07,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 101 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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) [2022-12-11 20:03:07,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:07,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2022-12-11 20:03:07,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:07,824 INFO L130 PetriNetUnfolder]: 578/1399 cut-off events. [2022-12-11 20:03:07,825 INFO L131 PetriNetUnfolder]: For 1052/1085 co-relation queries the response was YES. [2022-12-11 20:03:07,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 1399 events. 578/1399 cut-off events. For 1052/1085 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8946 event pairs, 144 based on Foata normal form. 17/1321 useless extension candidates. Maximal degree in co-relation 2809. Up to 478 conditions per place. [2022-12-11 20:03:07,833 INFO L137 encePairwiseOnDemand]: 83/92 looper letters, 72 selfloop transitions, 30 changer transitions 2/157 dead transitions. [2022-12-11 20:03:07,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 157 transitions, 873 flow [2022-12-11 20:03:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 20:03:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 20:03:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 541 transitions. [2022-12-11 20:03:07,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8400621118012422 [2022-12-11 20:03:07,835 INFO L175 Difference]: Start difference. First operand has 96 places, 101 transitions, 418 flow. Second operand 7 states and 541 transitions. [2022-12-11 20:03:07,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 157 transitions, 873 flow [2022-12-11 20:03:07,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 157 transitions, 855 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-11 20:03:07,840 INFO L231 Difference]: Finished difference. Result has 106 places, 114 transitions, 625 flow [2022-12-11 20:03:07,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=625, PETRI_PLACES=106, PETRI_TRANSITIONS=114} [2022-12-11 20:03:07,840 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 24 predicate places. [2022-12-11 20:03:07,841 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 114 transitions, 625 flow [2022-12-11 20:03:07,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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) [2022-12-11 20:03:07,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:07,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:07,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 20:03:07,842 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)] === [2022-12-11 20:03:07,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash -386590242, now seen corresponding path program 4 times [2022-12-11 20:03:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:07,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945145208] [2022-12-11 20:03:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:07,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:07,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945145208] [2022-12-11 20:03:07,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945145208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:07,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:07,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:03:07,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375179488] [2022-12-11 20:03:07,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:07,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:03:07,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:07,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:03:07,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:03:07,975 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2022-12-11 20:03:07,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 114 transitions, 625 flow. Second operand has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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) [2022-12-11 20:03:07,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:07,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2022-12-11 20:03:07,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:08,152 INFO L130 PetriNetUnfolder]: 593/1389 cut-off events. [2022-12-11 20:03:08,152 INFO L131 PetriNetUnfolder]: For 1948/1967 co-relation queries the response was YES. [2022-12-11 20:03:08,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3956 conditions, 1389 events. 593/1389 cut-off events. For 1948/1967 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8665 event pairs, 137 based on Foata normal form. 16/1311 useless extension candidates. Maximal degree in co-relation 3226. Up to 549 conditions per place. [2022-12-11 20:03:08,160 INFO L137 encePairwiseOnDemand]: 84/92 looper letters, 60 selfloop transitions, 34 changer transitions 2/149 dead transitions. [2022-12-11 20:03:08,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 149 transitions, 993 flow [2022-12-11 20:03:08,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 20:03:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 20:03:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 599 transitions. [2022-12-11 20:03:08,162 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.813858695652174 [2022-12-11 20:03:08,162 INFO L175 Difference]: Start difference. First operand has 106 places, 114 transitions, 625 flow. Second operand 8 states and 599 transitions. [2022-12-11 20:03:08,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 149 transitions, 993 flow [2022-12-11 20:03:08,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 149 transitions, 985 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-11 20:03:08,168 INFO L231 Difference]: Finished difference. Result has 116 places, 119 transitions, 753 flow [2022-12-11 20:03:08,168 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=753, PETRI_PLACES=116, PETRI_TRANSITIONS=119} [2022-12-11 20:03:08,169 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 34 predicate places. [2022-12-11 20:03:08,169 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 119 transitions, 753 flow [2022-12-11 20:03:08,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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) [2022-12-11 20:03:08,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:08,170 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:08,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 20:03:08,170 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)] === [2022-12-11 20:03:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1722849818, now seen corresponding path program 1 times [2022-12-11 20:03:08,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:08,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417034722] [2022-12-11 20:03:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:08,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:08,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417034722] [2022-12-11 20:03:08,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417034722] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:03:08,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230851752] [2022-12-11 20:03:08,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:08,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:03:08,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:03:08,411 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) [2022-12-11 20:03:08,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-11 20:03:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:08,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-11 20:03:08,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:03:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:08,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:03:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:09,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230851752] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:03:09,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:03:09,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-12-11 20:03:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560712375] [2022-12-11 20:03:09,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:03:09,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 20:03:09,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:09,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 20:03:09,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-12-11 20:03:09,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 92 [2022-12-11 20:03:09,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 119 transitions, 753 flow. Second operand has 14 states, 14 states have (on average 66.78571428571429) internal successors, (935), 14 states have internal predecessors, (935), 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) [2022-12-11 20:03:09,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:09,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 92 [2022-12-11 20:03:09,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:09,903 INFO L130 PetriNetUnfolder]: 2060/4225 cut-off events. [2022-12-11 20:03:09,904 INFO L131 PetriNetUnfolder]: For 8472/8472 co-relation queries the response was YES. [2022-12-11 20:03:09,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12999 conditions, 4225 events. 2060/4225 cut-off events. For 8472/8472 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 31837 event pairs, 205 based on Foata normal form. 70/3974 useless extension candidates. Maximal degree in co-relation 10264. Up to 940 conditions per place. [2022-12-11 20:03:09,960 INFO L137 encePairwiseOnDemand]: 77/92 looper letters, 198 selfloop transitions, 121 changer transitions 2/372 dead transitions. [2022-12-11 20:03:09,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 372 transitions, 3029 flow [2022-12-11 20:03:09,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-11 20:03:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-11 20:03:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1959 transitions. [2022-12-11 20:03:09,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.788647342995169 [2022-12-11 20:03:09,964 INFO L175 Difference]: Start difference. First operand has 116 places, 119 transitions, 753 flow. Second operand 27 states and 1959 transitions. [2022-12-11 20:03:09,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 372 transitions, 3029 flow [2022-12-11 20:03:09,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 372 transitions, 2881 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-12-11 20:03:09,987 INFO L231 Difference]: Finished difference. Result has 161 places, 221 transitions, 2020 flow [2022-12-11 20:03:09,987 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2020, PETRI_PLACES=161, PETRI_TRANSITIONS=221} [2022-12-11 20:03:09,989 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 79 predicate places. [2022-12-11 20:03:09,990 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 221 transitions, 2020 flow [2022-12-11 20:03:09,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 66.78571428571429) internal successors, (935), 14 states have internal predecessors, (935), 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) [2022-12-11 20:03:09,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:09,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:10,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-11 20:03:10,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-11 20:03:10,196 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)] === [2022-12-11 20:03:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:10,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1940271360, now seen corresponding path program 1 times [2022-12-11 20:03:10,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:10,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891574679] [2022-12-11 20:03:10,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:10,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:10,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:10,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891574679] [2022-12-11 20:03:10,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891574679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:10,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:10,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 20:03:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135944349] [2022-12-11 20:03:10,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:10,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 20:03:10,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:10,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 20:03:10,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-11 20:03:10,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2022-12-11 20:03:10,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 221 transitions, 2020 flow. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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) [2022-12-11 20:03:10,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:10,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2022-12-11 20:03:10,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:11,225 INFO L130 PetriNetUnfolder]: 2029/4845 cut-off events. [2022-12-11 20:03:11,225 INFO L131 PetriNetUnfolder]: For 27627/28018 co-relation queries the response was YES. [2022-12-11 20:03:11,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21207 conditions, 4845 events. 2029/4845 cut-off events. For 27627/28018 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 43027 event pairs, 229 based on Foata normal form. 72/4735 useless extension candidates. Maximal degree in co-relation 20188. Up to 1298 conditions per place. [2022-12-11 20:03:11,264 INFO L137 encePairwiseOnDemand]: 83/92 looper letters, 167 selfloop transitions, 131 changer transitions 3/390 dead transitions. [2022-12-11 20:03:11,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 390 transitions, 4546 flow [2022-12-11 20:03:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 20:03:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 20:03:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions. [2022-12-11 20:03:11,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-12-11 20:03:11,266 INFO L175 Difference]: Start difference. First operand has 161 places, 221 transitions, 2020 flow. Second operand 6 states and 468 transitions. [2022-12-11 20:03:11,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 390 transitions, 4546 flow [2022-12-11 20:03:11,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 390 transitions, 4296 flow, removed 102 selfloop flow, removed 2 redundant places. [2022-12-11 20:03:11,352 INFO L231 Difference]: Finished difference. Result has 169 places, 315 transitions, 3513 flow [2022-12-11 20:03:11,352 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3513, PETRI_PLACES=169, PETRI_TRANSITIONS=315} [2022-12-11 20:03:11,353 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 87 predicate places. [2022-12-11 20:03:11,353 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 315 transitions, 3513 flow [2022-12-11 20:03:11,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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) [2022-12-11 20:03:11,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:11,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:11,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 20:03:11,353 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)] === [2022-12-11 20:03:11,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:11,354 INFO L85 PathProgramCache]: Analyzing trace with hash -849894740, now seen corresponding path program 2 times [2022-12-11 20:03:11,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:11,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250900068] [2022-12-11 20:03:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:11,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:11,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:11,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250900068] [2022-12-11 20:03:11,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250900068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:11,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:11,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 20:03:11,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867196234] [2022-12-11 20:03:11,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:11,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 20:03:11,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:11,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 20:03:11,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 20:03:11,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2022-12-11 20:03:11,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 315 transitions, 3513 flow. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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) [2022-12-11 20:03:11,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:11,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2022-12-11 20:03:11,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:12,369 INFO L130 PetriNetUnfolder]: 2255/5553 cut-off events. [2022-12-11 20:03:12,369 INFO L131 PetriNetUnfolder]: For 40080/40599 co-relation queries the response was YES. [2022-12-11 20:03:12,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26345 conditions, 5553 events. 2255/5553 cut-off events. For 40080/40599 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 50781 event pairs, 433 based on Foata normal form. 70/5383 useless extension candidates. Maximal degree in co-relation 25289. Up to 1623 conditions per place. [2022-12-11 20:03:12,427 INFO L137 encePairwiseOnDemand]: 82/92 looper letters, 156 selfloop transitions, 162 changer transitions 0/407 dead transitions. [2022-12-11 20:03:12,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 407 transitions, 5037 flow [2022-12-11 20:03:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 20:03:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 20:03:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2022-12-11 20:03:12,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8260869565217391 [2022-12-11 20:03:12,429 INFO L175 Difference]: Start difference. First operand has 169 places, 315 transitions, 3513 flow. Second operand 6 states and 456 transitions. [2022-12-11 20:03:12,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 407 transitions, 5037 flow [2022-12-11 20:03:12,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 407 transitions, 4991 flow, removed 23 selfloop flow, removed 0 redundant places. [2022-12-11 20:03:12,615 INFO L231 Difference]: Finished difference. Result has 177 places, 349 transitions, 4421 flow [2022-12-11 20:03:12,615 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=3477, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4421, PETRI_PLACES=177, PETRI_TRANSITIONS=349} [2022-12-11 20:03:12,616 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 95 predicate places. [2022-12-11 20:03:12,616 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 349 transitions, 4421 flow [2022-12-11 20:03:12,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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) [2022-12-11 20:03:12,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:12,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:12,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 20:03:12,617 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)] === [2022-12-11 20:03:12,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:12,617 INFO L85 PathProgramCache]: Analyzing trace with hash 428727004, now seen corresponding path program 3 times [2022-12-11 20:03:12,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:12,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760573722] [2022-12-11 20:03:12,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:12,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:12,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760573722] [2022-12-11 20:03:12,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760573722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:12,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:12,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 20:03:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324841750] [2022-12-11 20:03:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:12,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 20:03:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:12,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 20:03:12,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-11 20:03:12,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2022-12-11 20:03:12,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 349 transitions, 4421 flow. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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) [2022-12-11 20:03:12,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:12,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2022-12-11 20:03:12,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:13,662 INFO L130 PetriNetUnfolder]: 2285/5638 cut-off events. [2022-12-11 20:03:13,662 INFO L131 PetriNetUnfolder]: For 45942/46515 co-relation queries the response was YES. [2022-12-11 20:03:13,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28174 conditions, 5638 events. 2285/5638 cut-off events. For 45942/46515 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 52025 event pairs, 336 based on Foata normal form. 75/5504 useless extension candidates. Maximal degree in co-relation 26988. Up to 1831 conditions per place. [2022-12-11 20:03:13,721 INFO L137 encePairwiseOnDemand]: 83/92 looper letters, 168 selfloop transitions, 194 changer transitions 1/452 dead transitions. [2022-12-11 20:03:13,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 452 transitions, 6287 flow [2022-12-11 20:03:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-11 20:03:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-11 20:03:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 393 transitions. [2022-12-11 20:03:13,722 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8543478260869565 [2022-12-11 20:03:13,722 INFO L175 Difference]: Start difference. First operand has 177 places, 349 transitions, 4421 flow. Second operand 5 states and 393 transitions. [2022-12-11 20:03:13,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 452 transitions, 6287 flow [2022-12-11 20:03:13,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 452 transitions, 6097 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-11 20:03:13,922 INFO L231 Difference]: Finished difference. Result has 182 places, 395 transitions, 5470 flow [2022-12-11 20:03:13,923 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=4254, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5470, PETRI_PLACES=182, PETRI_TRANSITIONS=395} [2022-12-11 20:03:13,923 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 100 predicate places. [2022-12-11 20:03:13,923 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 395 transitions, 5470 flow [2022-12-11 20:03:13,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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) [2022-12-11 20:03:13,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:13,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:13,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 20:03:13,924 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)] === [2022-12-11 20:03:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1116321822, now seen corresponding path program 4 times [2022-12-11 20:03:13,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:13,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091434860] [2022-12-11 20:03:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:14,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:14,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091434860] [2022-12-11 20:03:14,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091434860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:14,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:14,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 20:03:14,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520225763] [2022-12-11 20:03:14,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:14,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 20:03:14,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:14,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 20:03:14,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 20:03:14,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2022-12-11 20:03:14,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 395 transitions, 5470 flow. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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) [2022-12-11 20:03:14,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:14,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2022-12-11 20:03:14,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:15,059 INFO L130 PetriNetUnfolder]: 2240/5563 cut-off events. [2022-12-11 20:03:15,059 INFO L131 PetriNetUnfolder]: For 52696/53407 co-relation queries the response was YES. [2022-12-11 20:03:15,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29440 conditions, 5563 events. 2240/5563 cut-off events. For 52696/53407 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 51240 event pairs, 347 based on Foata normal form. 130/5462 useless extension candidates. Maximal degree in co-relation 28279. Up to 1786 conditions per place. [2022-12-11 20:03:15,111 INFO L137 encePairwiseOnDemand]: 84/92 looper letters, 162 selfloop transitions, 183 changer transitions 2/436 dead transitions. [2022-12-11 20:03:15,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 436 transitions, 6569 flow [2022-12-11 20:03:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-11 20:03:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-11 20:03:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 391 transitions. [2022-12-11 20:03:15,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.85 [2022-12-11 20:03:15,113 INFO L175 Difference]: Start difference. First operand has 182 places, 395 transitions, 5470 flow. Second operand 5 states and 391 transitions. [2022-12-11 20:03:15,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 436 transitions, 6569 flow [2022-12-11 20:03:15,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 436 transitions, 6547 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-12-11 20:03:15,243 INFO L231 Difference]: Finished difference. Result has 189 places, 395 transitions, 6040 flow [2022-12-11 20:03:15,244 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=5323, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6040, PETRI_PLACES=189, PETRI_TRANSITIONS=395} [2022-12-11 20:03:15,245 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 107 predicate places. [2022-12-11 20:03:15,245 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 395 transitions, 6040 flow [2022-12-11 20:03:15,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 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) [2022-12-11 20:03:15,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:15,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:15,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 20:03:15,245 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)] === [2022-12-11 20:03:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash 129704276, now seen corresponding path program 5 times [2022-12-11 20:03:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:15,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177000770] [2022-12-11 20:03:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:15,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:15,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:15,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177000770] [2022-12-11 20:03:15,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177000770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:15,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:15,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:03:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865849878] [2022-12-11 20:03:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:15,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:03:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:15,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:03:15,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:03:15,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 92 [2022-12-11 20:03:15,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 395 transitions, 6040 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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) [2022-12-11 20:03:15,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:15,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 92 [2022-12-11 20:03:15,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:16,555 INFO L130 PetriNetUnfolder]: 2788/6515 cut-off events. [2022-12-11 20:03:16,556 INFO L131 PetriNetUnfolder]: For 73160/73953 co-relation queries the response was YES. [2022-12-11 20:03:16,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37371 conditions, 6515 events. 2788/6515 cut-off events. For 73160/73953 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 59951 event pairs, 440 based on Foata normal form. 162/6440 useless extension candidates. Maximal degree in co-relation 35930. Up to 1311 conditions per place. [2022-12-11 20:03:16,620 INFO L137 encePairwiseOnDemand]: 83/92 looper letters, 208 selfloop transitions, 211 changer transitions 2/510 dead transitions. [2022-12-11 20:03:16,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 510 transitions, 8327 flow [2022-12-11 20:03:16,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 20:03:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 20:03:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 545 transitions. [2022-12-11 20:03:16,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8462732919254659 [2022-12-11 20:03:16,622 INFO L175 Difference]: Start difference. First operand has 189 places, 395 transitions, 6040 flow. Second operand 7 states and 545 transitions. [2022-12-11 20:03:16,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 510 transitions, 8327 flow [2022-12-11 20:03:16,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 510 transitions, 8130 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-11 20:03:16,899 INFO L231 Difference]: Finished difference. Result has 195 places, 411 transitions, 6676 flow [2022-12-11 20:03:16,900 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=5869, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6676, PETRI_PLACES=195, PETRI_TRANSITIONS=411} [2022-12-11 20:03:16,900 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 113 predicate places. [2022-12-11 20:03:16,900 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 411 transitions, 6676 flow [2022-12-11 20:03:16,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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) [2022-12-11 20:03:16,901 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:16,901 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:16,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 20:03:16,901 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)] === [2022-12-11 20:03:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash 877339972, now seen corresponding path program 6 times [2022-12-11 20:03:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:16,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381191814] [2022-12-11 20:03:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:17,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:17,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381191814] [2022-12-11 20:03:17,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381191814] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:03:17,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409498139] [2022-12-11 20:03:17,025 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-11 20:03:17,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:03:17,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:03:17,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 20:03:17,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-11 20:03:17,103 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-11 20:03:17,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 20:03:17,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-11 20:03:17,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:03:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:17,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:03:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:17,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409498139] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:03:17,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:03:17,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2022-12-11 20:03:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395475972] [2022-12-11 20:03:17,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:03:17,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-11 20:03:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:17,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-11 20:03:17,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-12-11 20:03:17,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 92 [2022-12-11 20:03:17,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 411 transitions, 6676 flow. Second operand has 16 states, 16 states have (on average 62.875) internal successors, (1006), 16 states have internal predecessors, (1006), 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) [2022-12-11 20:03:17,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:17,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 92 [2022-12-11 20:03:17,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:20,541 INFO L130 PetriNetUnfolder]: 6407/13948 cut-off events. [2022-12-11 20:03:20,542 INFO L131 PetriNetUnfolder]: For 175393/175673 co-relation queries the response was YES. [2022-12-11 20:03:20,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82856 conditions, 13948 events. 6407/13948 cut-off events. For 175393/175673 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 137657 event pairs, 752 based on Foata normal form. 348/13996 useless extension candidates. Maximal degree in co-relation 81123. Up to 3164 conditions per place. [2022-12-11 20:03:20,793 INFO L137 encePairwiseOnDemand]: 79/92 looper letters, 553 selfloop transitions, 231 changer transitions 20/878 dead transitions. [2022-12-11 20:03:20,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 878 transitions, 16046 flow [2022-12-11 20:03:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 20:03:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 20:03:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1023 transitions. [2022-12-11 20:03:20,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.741304347826087 [2022-12-11 20:03:20,796 INFO L175 Difference]: Start difference. First operand has 195 places, 411 transitions, 6676 flow. Second operand 15 states and 1023 transitions. [2022-12-11 20:03:20,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 878 transitions, 16046 flow [2022-12-11 20:03:21,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 878 transitions, 15173 flow, removed 50 selfloop flow, removed 4 redundant places. [2022-12-11 20:03:21,319 INFO L231 Difference]: Finished difference. Result has 217 places, 547 transitions, 9831 flow [2022-12-11 20:03:21,319 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=6315, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=9831, PETRI_PLACES=217, PETRI_TRANSITIONS=547} [2022-12-11 20:03:21,321 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 135 predicate places. [2022-12-11 20:03:21,321 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 547 transitions, 9831 flow [2022-12-11 20:03:21,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 62.875) internal successors, (1006), 16 states have internal predecessors, (1006), 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) [2022-12-11 20:03:21,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:21,322 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:21,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-11 20:03:21,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-11 20:03:21,527 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)] === [2022-12-11 20:03:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1990274760, now seen corresponding path program 7 times [2022-12-11 20:03:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:21,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109882171] [2022-12-11 20:03:21,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:21,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:21,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:21,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109882171] [2022-12-11 20:03:21,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109882171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:21,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:21,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 20:03:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912296589] [2022-12-11 20:03:21,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:21,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 20:03:21,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:21,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 20:03:21,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 20:03:21,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2022-12-11 20:03:21,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 547 transitions, 9831 flow. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 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) [2022-12-11 20:03:21,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:21,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2022-12-11 20:03:21,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:24,537 INFO L130 PetriNetUnfolder]: 6492/14108 cut-off events. [2022-12-11 20:03:24,537 INFO L131 PetriNetUnfolder]: For 200684/201025 co-relation queries the response was YES. [2022-12-11 20:03:24,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90309 conditions, 14108 events. 6492/14108 cut-off events. For 200684/201025 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 139919 event pairs, 1428 based on Foata normal form. 57/13824 useless extension candidates. Maximal degree in co-relation 90092. Up to 9382 conditions per place. [2022-12-11 20:03:24,682 INFO L137 encePairwiseOnDemand]: 84/92 looper letters, 430 selfloop transitions, 90 changer transitions 14/614 dead transitions. [2022-12-11 20:03:24,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 614 transitions, 11871 flow [2022-12-11 20:03:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 20:03:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 20:03:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2022-12-11 20:03:24,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8278985507246377 [2022-12-11 20:03:24,687 INFO L175 Difference]: Start difference. First operand has 217 places, 547 transitions, 9831 flow. Second operand 6 states and 457 transitions. [2022-12-11 20:03:24,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 614 transitions, 11871 flow [2022-12-11 20:03:25,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 614 transitions, 11713 flow, removed 78 selfloop flow, removed 3 redundant places. [2022-12-11 20:03:25,617 INFO L231 Difference]: Finished difference. Result has 219 places, 552 transitions, 10058 flow [2022-12-11 20:03:25,617 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=9683, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10058, PETRI_PLACES=219, PETRI_TRANSITIONS=552} [2022-12-11 20:03:25,618 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 137 predicate places. [2022-12-11 20:03:25,618 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 552 transitions, 10058 flow [2022-12-11 20:03:25,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 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) [2022-12-11 20:03:25,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:25,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:25,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 20:03:25,619 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)] === [2022-12-11 20:03:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:25,619 INFO L85 PathProgramCache]: Analyzing trace with hash 929344250, now seen corresponding path program 8 times [2022-12-11 20:03:25,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:25,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445448955] [2022-12-11 20:03:25,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:25,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:25,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445448955] [2022-12-11 20:03:25,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445448955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:03:25,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:03:25,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 20:03:25,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707044372] [2022-12-11 20:03:25,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:03:25,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 20:03:25,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:25,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 20:03:25,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-11 20:03:25,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 92 [2022-12-11 20:03:25,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 552 transitions, 10058 flow. Second operand has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 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) [2022-12-11 20:03:25,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:25,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 92 [2022-12-11 20:03:25,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:28,195 INFO L130 PetriNetUnfolder]: 6419/13712 cut-off events. [2022-12-11 20:03:28,196 INFO L131 PetriNetUnfolder]: For 195601/195987 co-relation queries the response was YES. [2022-12-11 20:03:28,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87762 conditions, 13712 events. 6419/13712 cut-off events. For 195601/195987 co-relation queries the response was YES. Maximal size of possible extension queue 1006. Compared 133776 event pairs, 1782 based on Foata normal form. 58/13385 useless extension candidates. Maximal degree in co-relation 86319. Up to 9449 conditions per place. [2022-12-11 20:03:28,338 INFO L137 encePairwiseOnDemand]: 84/92 looper letters, 382 selfloop transitions, 78 changer transitions 11/551 dead transitions. [2022-12-11 20:03:28,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 551 transitions, 10848 flow [2022-12-11 20:03:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 20:03:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 20:03:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 436 transitions. [2022-12-11 20:03:28,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7898550724637681 [2022-12-11 20:03:28,341 INFO L175 Difference]: Start difference. First operand has 219 places, 552 transitions, 10058 flow. Second operand 6 states and 436 transitions. [2022-12-11 20:03:28,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 551 transitions, 10848 flow [2022-12-11 20:03:29,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 551 transitions, 10613 flow, removed 32 selfloop flow, removed 6 redundant places. [2022-12-11 20:03:29,136 INFO L231 Difference]: Finished difference. Result has 220 places, 538 transitions, 9702 flow [2022-12-11 20:03:29,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=9610, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9702, PETRI_PLACES=220, PETRI_TRANSITIONS=538} [2022-12-11 20:03:29,137 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 138 predicate places. [2022-12-11 20:03:29,137 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 538 transitions, 9702 flow [2022-12-11 20:03:29,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 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) [2022-12-11 20:03:29,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:29,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:29,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 20:03:29,138 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)] === [2022-12-11 20:03:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1626497579, now seen corresponding path program 1 times [2022-12-11 20:03:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:29,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260438997] [2022-12-11 20:03:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:29,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:29,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260438997] [2022-12-11 20:03:29,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260438997] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:03:29,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820897414] [2022-12-11 20:03:29,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:29,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:03:29,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:03:29,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 20:03:29,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-11 20:03:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:29,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-11 20:03:29,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:03:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:29,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:03:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:30,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820897414] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:03:30,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:03:30,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 17 [2022-12-11 20:03:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896721783] [2022-12-11 20:03:30,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:03:30,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-11 20:03:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-11 20:03:30,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-12-11 20:03:30,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 92 [2022-12-11 20:03:30,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 538 transitions, 9702 flow. Second operand has 17 states, 17 states have (on average 62.294117647058826) internal successors, (1059), 17 states have internal predecessors, (1059), 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) [2022-12-11 20:03:30,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:30,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 92 [2022-12-11 20:03:30,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:33,388 INFO L130 PetriNetUnfolder]: 6419/16093 cut-off events. [2022-12-11 20:03:33,388 INFO L131 PetriNetUnfolder]: For 207353/208476 co-relation queries the response was YES. [2022-12-11 20:03:33,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96844 conditions, 16093 events. 6419/16093 cut-off events. For 207353/208476 co-relation queries the response was YES. Maximal size of possible extension queue 1228. Compared 176435 event pairs, 694 based on Foata normal form. 406/16119 useless extension candidates. Maximal degree in co-relation 94832. Up to 5997 conditions per place. [2022-12-11 20:03:33,595 INFO L137 encePairwiseOnDemand]: 78/92 looper letters, 474 selfloop transitions, 404 changer transitions 7/983 dead transitions. [2022-12-11 20:03:33,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 983 transitions, 18965 flow [2022-12-11 20:03:33,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 20:03:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 20:03:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1067 transitions. [2022-12-11 20:03:33,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7248641304347826 [2022-12-11 20:03:33,608 INFO L175 Difference]: Start difference. First operand has 220 places, 538 transitions, 9702 flow. Second operand 16 states and 1067 transitions. [2022-12-11 20:03:33,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 983 transitions, 18965 flow [2022-12-11 20:03:34,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 983 transitions, 18648 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-12-11 20:03:34,521 INFO L231 Difference]: Finished difference. Result has 229 places, 765 transitions, 14766 flow [2022-12-11 20:03:34,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=9411, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=14766, PETRI_PLACES=229, PETRI_TRANSITIONS=765} [2022-12-11 20:03:34,522 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 147 predicate places. [2022-12-11 20:03:34,522 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 765 transitions, 14766 flow [2022-12-11 20:03:34,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 62.294117647058826) internal successors, (1059), 17 states have internal predecessors, (1059), 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) [2022-12-11 20:03:34,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:34,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:34,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-11 20:03:34,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:03:34,727 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 20:03:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash 424220009, now seen corresponding path program 2 times [2022-12-11 20:03:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:34,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844407226] [2022-12-11 20:03:34,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:35,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:35,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844407226] [2022-12-11 20:03:35,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844407226] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:03:35,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571946348] [2022-12-11 20:03:35,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 20:03:35,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:03:35,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:03:35,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 20:03:35,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-11 20:03:35,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 20:03:35,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 20:03:35,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-11 20:03:35,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:03:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:35,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:03:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:35,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571946348] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:03:35,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:03:35,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2022-12-11 20:03:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250196281] [2022-12-11 20:03:35,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:03:35,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 20:03:35,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:35,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 20:03:35,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-12-11 20:03:35,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 92 [2022-12-11 20:03:35,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 765 transitions, 14766 flow. Second operand has 18 states, 18 states have (on average 60.5) internal successors, (1089), 18 states have internal predecessors, (1089), 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) [2022-12-11 20:03:35,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:35,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 92 [2022-12-11 20:03:35,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:41,006 INFO L130 PetriNetUnfolder]: 9813/23370 cut-off events. [2022-12-11 20:03:41,006 INFO L131 PetriNetUnfolder]: For 337796/339169 co-relation queries the response was YES. [2022-12-11 20:03:41,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149335 conditions, 23370 events. 9813/23370 cut-off events. For 337796/339169 co-relation queries the response was YES. Maximal size of possible extension queue 1764. Compared 266818 event pairs, 767 based on Foata normal form. 454/23346 useless extension candidates. Maximal degree in co-relation 148947. Up to 6503 conditions per place. [2022-12-11 20:03:41,303 INFO L137 encePairwiseOnDemand]: 76/92 looper letters, 636 selfloop transitions, 712 changer transitions 14/1431 dead transitions. [2022-12-11 20:03:41,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 1431 transitions, 29116 flow [2022-12-11 20:03:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-11 20:03:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-11 20:03:41,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1441 transitions. [2022-12-11 20:03:41,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7119565217391305 [2022-12-11 20:03:41,305 INFO L175 Difference]: Start difference. First operand has 229 places, 765 transitions, 14766 flow. Second operand 22 states and 1441 transitions. [2022-12-11 20:03:41,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 1431 transitions, 29116 flow [2022-12-11 20:03:42,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 1431 transitions, 28461 flow, removed 287 selfloop flow, removed 5 redundant places. [2022-12-11 20:03:42,934 INFO L231 Difference]: Finished difference. Result has 250 places, 1023 transitions, 21687 flow [2022-12-11 20:03:42,934 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=14175, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=765, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=510, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=21687, PETRI_PLACES=250, PETRI_TRANSITIONS=1023} [2022-12-11 20:03:42,934 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 168 predicate places. [2022-12-11 20:03:42,935 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 1023 transitions, 21687 flow [2022-12-11 20:03:42,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 60.5) internal successors, (1089), 18 states have internal predecessors, (1089), 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) [2022-12-11 20:03:42,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:42,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:42,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-11 20:03:43,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-11 20:03:43,140 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 20:03:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1332571893, now seen corresponding path program 3 times [2022-12-11 20:03:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:43,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267608605] [2022-12-11 20:03:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:43,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:43,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267608605] [2022-12-11 20:03:43,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267608605] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:03:43,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718573097] [2022-12-11 20:03:43,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 20:03:43,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:03:43,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:03:43,417 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 20:03:43,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-11 20:03:43,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-11 20:03:43,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 20:03:43,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-11 20:03:43,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:03:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:43,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:03:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:44,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718573097] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:03:44,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:03:44,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 21 [2022-12-11 20:03:44,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916072142] [2022-12-11 20:03:44,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:03:44,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-11 20:03:44,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:44,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-11 20:03:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-12-11 20:03:44,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 92 [2022-12-11 20:03:44,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 1023 transitions, 21687 flow. Second operand has 21 states, 21 states have (on average 61.523809523809526) internal successors, (1292), 21 states have internal predecessors, (1292), 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) [2022-12-11 20:03:44,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:44,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 92 [2022-12-11 20:03:44,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:03:46,276 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([241] L53-->L45: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_3} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_3} AuxVars[] AssignedVars[][34], [Black: 638#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 131#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 127#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 642#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 32#L80true, Black: 126#(= ~N~0 ~L~0), 639#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 636#true, 1882#(or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296))), Black: 139#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= ~N~0 ~L~0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 140#(and (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 143#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 654#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 141#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 657#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 124#true, Black: 664#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= thread2Thread1of1ForFork0_~cond~1 0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 46#L45true, Black: 663#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 153#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 158#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 672#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 984#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 675#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 2085#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1886#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))), 6#L72true, Black: 2078#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), Black: 2087#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1619#true, Black: 2066#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< ~p~0 (+ ~q~0 1 (* (div (+ (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296))) (< 0 (mod ~N~0 4294967296)))) (or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296)))), Black: 684#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 136#true, 169#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 63#L99-4true, 2095#true, Black: 1259#(and (= ~q~0 0) (or (and (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~p~0 0)))), 683#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 665#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 1600#(and (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~q~0 (+ (* (div (+ (* (- 1) ~p~0) ~q~0) 4294967296) 4294967296) ~p~0 1)) (< 0 (mod ~N~0 4294967296))))), Black: 1608#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0) (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), 98#true, 1162#true, Black: 486#(or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 162#true, Black: 587#(and (= ~N~0 ~L~0) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 164#(= ~N~0 ~L~0), 650#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 490#(or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 166#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 275#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296)))) (and (< 1 (mod ~L~0 4294967296)) (= thread2Thread1of1ForFork0_~cond~1 1))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 1119#(and (= ~p~0 0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 591#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 167#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 693#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 599#(and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 1113#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 427#(or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 727#(= ~p~0 0), Black: 609#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 688#true, Black: 1123#(and (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod ~L~0 4294967296))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 603#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 762#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 585#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 1117#(and (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 593#(and (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 601#(and (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 482#(or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 165#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 116#(and (= ~N~0 ~L~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 168#(or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 597#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 605#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 119#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 589#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 1146#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0))]) [2022-12-11 20:03:46,279 INFO L382 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2022-12-11 20:03:46,279 INFO L385 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-11 20:03:46,279 INFO L385 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-11 20:03:46,279 INFO L385 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-11 20:03:46,279 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([259] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_20))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_20, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_20, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_1|, ~L~0=v_~L~0_14} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2][718], [Black: 638#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 131#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 127#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 642#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 126#(= ~N~0 ~L~0), 639#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 636#true, 688#true, Black: 139#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= ~N~0 ~L~0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 140#(and (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 143#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 654#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 141#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 657#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 124#true, Black: 664#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= thread2Thread1of1ForFork0_~cond~1 0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 665#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 1619#true, Black: 154#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 153#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 158#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 672#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 675#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 2085#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 80#L53true, Black: 1886#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))), 6#L72true, Black: 2078#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), Black: 1882#(or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296))), Black: 2087#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2066#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< ~p~0 (+ ~q~0 1 (* (div (+ (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296))) (< 0 (mod ~N~0 4294967296)))) (or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296)))), Black: 684#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 136#true, 42#L83true, 63#L99-4true, 2095#true, Black: 1259#(and (= ~q~0 0) (or (and (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~p~0 0)))), Black: 1600#(and (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~q~0 (+ (* (div (+ (* (- 1) ~p~0) ~q~0) 4294967296) 4294967296) ~p~0 1)) (< 0 (mod ~N~0 4294967296))))), Black: 1608#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0) (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), 98#true, 1162#true, Black: 486#(or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), 162#true, Black: 587#(and (= ~N~0 ~L~0) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 164#(= ~N~0 ~L~0), 650#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 490#(or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 166#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 275#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296)))) (and (< 1 (mod ~L~0 4294967296)) (= thread2Thread1of1ForFork0_~cond~1 1))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 1119#(and (= ~p~0 0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 984#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 591#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 167#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 693#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 599#(and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 1113#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 427#(or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 727#(= ~p~0 0), Black: 609#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 603#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 1123#(and (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod ~L~0 4294967296))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 762#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 585#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 1117#(and (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 593#(and (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 601#(and (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 482#(or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 165#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 169#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 116#(and (= ~N~0 ~L~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 168#(or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 597#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 605#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 119#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 589#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 1146#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), 663#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))]) [2022-12-11 20:03:46,279 INFO L382 tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event [2022-12-11 20:03:46,279 INFO L385 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-11 20:03:46,279 INFO L385 tUnfolder$Statistics]: existing Event has 47 ancestors and is cut-off event [2022-12-11 20:03:46,280 INFO L385 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-11 20:03:47,138 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([241] L53-->L45: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_3} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_3} AuxVars[] AssignedVars[][34], [Black: 638#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 639#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 131#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 127#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 32#L80true, Black: 126#(= ~N~0 ~L~0), Black: 636#true, 1882#(or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296))), Black: 139#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= ~N~0 ~L~0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 140#(and (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 143#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 654#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 141#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 657#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 124#true, 642#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 664#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= thread2Thread1of1ForFork0_~cond~1 0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 46#L45true, Black: 663#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 153#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 158#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 672#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 984#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 675#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 2085#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1886#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))), Black: 2078#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), Black: 2087#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1619#true, Black: 2066#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< ~p~0 (+ ~q~0 1 (* (div (+ (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296))) (< 0 (mod ~N~0 4294967296)))) (or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296)))), Black: 684#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 136#true, 169#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 63#L99-4true, 2095#true, Black: 1259#(and (= ~q~0 0) (or (and (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~p~0 0)))), 665#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), 683#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 1600#(and (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~q~0 (+ (* (div (+ (* (- 1) ~p~0) ~q~0) 4294967296) 4294967296) ~p~0 1)) (< 0 (mod ~N~0 4294967296))))), Black: 1608#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0) (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), 98#true, 1162#true, Black: 486#(or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 162#true, Black: 587#(and (= ~N~0 ~L~0) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 164#(= ~N~0 ~L~0), 650#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 490#(or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), 41#L63-1true, Black: 166#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 275#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296)))) (and (< 1 (mod ~L~0 4294967296)) (= thread2Thread1of1ForFork0_~cond~1 1))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 1119#(and (= ~p~0 0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 591#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 167#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 693#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 599#(and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 1113#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 427#(or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 727#(= ~p~0 0), Black: 609#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 688#true, Black: 1123#(and (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod ~L~0 4294967296))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 603#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 762#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 585#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 1117#(and (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 593#(and (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 601#(and (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 482#(or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 165#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 116#(and (= ~N~0 ~L~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 168#(or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 597#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 605#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 119#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 589#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 1146#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0))]) [2022-12-11 20:03:47,138 INFO L382 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2022-12-11 20:03:47,138 INFO L385 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-11 20:03:47,138 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-11 20:03:47,138 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-11 20:03:47,138 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([259] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_20))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_20, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_20, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_1|, ~L~0=v_~L~0_14} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2][718], [Black: 638#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 639#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 131#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 127#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 126#(= ~N~0 ~L~0), Black: 636#true, 688#true, Black: 139#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= ~N~0 ~L~0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 140#(and (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 143#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 654#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 141#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 657#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 124#true, 642#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 664#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= thread2Thread1of1ForFork0_~cond~1 0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 665#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 154#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 1619#true, Black: 153#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 158#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 672#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 675#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 2085#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 80#L53true, Black: 1886#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))), Black: 2078#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), Black: 1882#(or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296))), Black: 2087#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2066#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< ~p~0 (+ ~q~0 1 (* (div (+ (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296))) (< 0 (mod ~N~0 4294967296)))) (or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296)))), Black: 684#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 136#true, 42#L83true, 63#L99-4true, 2095#true, Black: 1259#(and (= ~q~0 0) (or (and (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~p~0 0)))), Black: 1600#(and (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~q~0 (+ (* (div (+ (* (- 1) ~p~0) ~q~0) 4294967296) 4294967296) ~p~0 1)) (< 0 (mod ~N~0 4294967296))))), Black: 1608#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0) (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), 98#true, 1162#true, Black: 486#(or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), 162#true, Black: 587#(and (= ~N~0 ~L~0) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 164#(= ~N~0 ~L~0), 650#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 490#(or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), 41#L63-1true, Black: 166#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 275#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296)))) (and (< 1 (mod ~L~0 4294967296)) (= thread2Thread1of1ForFork0_~cond~1 1))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 1119#(and (= ~p~0 0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 984#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 591#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 167#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 693#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 599#(and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 1113#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 427#(or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 727#(= ~p~0 0), Black: 609#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 1123#(and (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod ~L~0 4294967296))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 603#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 762#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 585#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 1117#(and (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 593#(and (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 601#(and (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 482#(or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 165#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 169#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 116#(and (= ~N~0 ~L~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 168#(or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 597#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 605#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 119#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 589#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 1146#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0)), 663#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))]) [2022-12-11 20:03:47,152 INFO L382 tUnfolder$Statistics]: this new event has 48 ancestors and is cut-off event [2022-12-11 20:03:47,152 INFO L385 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-11 20:03:47,152 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-11 20:03:47,152 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-11 20:03:49,200 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([259] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_20))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_20, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_20, thread3Thread1of1ForFork1_#t~post2=|v_thread3Thread1of1ForFork1_#t~post2_1|, ~L~0=v_~L~0_14} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork1_#t~post2][718], [Black: 638#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 639#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 131#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 642#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 127#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 636#true, Black: 126#(= ~N~0 ~L~0), 688#true, Black: 139#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= ~N~0 ~L~0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 140#(and (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 143#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 654#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 657#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 124#true, Black: 141#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 665#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 663#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 1619#true, Black: 153#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 158#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 671#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 675#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 2085#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 640#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), 80#L53true, Black: 1886#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))), Black: 2078#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), Black: 1882#(or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296))), 664#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= thread2Thread1of1ForFork0_~cond~1 0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 2087#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2066#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< ~p~0 (+ ~q~0 1 (* (div (+ (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296))) (< 0 (mod ~N~0 4294967296)))) (or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296)))), Black: 684#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 136#true, 42#L83true, 63#L99-4true, 2095#true, Black: 1259#(and (= ~q~0 0) (or (and (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~p~0 0)))), Black: 1600#(and (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~q~0 (+ (* (div (+ (* (- 1) ~p~0) ~q~0) 4294967296) 4294967296) ~p~0 1)) (< 0 (mod ~N~0 4294967296))))), Black: 1608#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0) (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), 672#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 98#true, 1162#true, Black: 486#(or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), 162#true, Black: 587#(and (= ~N~0 ~L~0) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 164#(= ~N~0 ~L~0), 650#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 41#L63-1true, Black: 490#(or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 166#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 275#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296)))) (and (< 1 (mod ~L~0 4294967296)) (= thread2Thread1of1ForFork0_~cond~1 1))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 1119#(and (= ~p~0 0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 984#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 591#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 167#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 693#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 1113#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 599#(and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 427#(or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 727#(= ~p~0 0), Black: 609#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 603#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 1123#(and (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod ~L~0 4294967296))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 762#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 585#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 593#(and (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 1117#(and (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 601#(and (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 482#(or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 165#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 169#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), Black: 168#(or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 116#(and (= ~N~0 ~L~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 597#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 605#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 119#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 589#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 1146#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0))]) [2022-12-11 20:03:49,201 INFO L382 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2022-12-11 20:03:49,201 INFO L385 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-11 20:03:49,201 INFO L385 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-11 20:03:49,201 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-11 20:03:49,201 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([241] L53-->L45: Formula: (not (= (mod v_thread1Thread1of1ForFork2_~cond~0_3 256) 0)) InVars {thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_3} OutVars{thread1Thread1of1ForFork2_~cond~0=v_thread1Thread1of1ForFork2_~cond~0_3} AuxVars[] AssignedVars[][107], [Black: 638#(or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))), Black: 639#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 131#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 642#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 127#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 32#L80true, Black: 636#true, Black: 126#(= ~N~0 ~L~0), 1882#(or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296))), Black: 139#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= ~N~0 ~L~0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 140#(and (or (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 143#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 654#(and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 657#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 124#true, Black: 141#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 46#L45true, Black: 664#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (= thread2Thread1of1ForFork0_~cond~1 0) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 663#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), Black: 154#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 153#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 158#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 671#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 984#(or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< ~p~0 (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296) 1)) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1)))), Black: 675#(and (= thread2Thread1of1ForFork0_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 2085#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 640#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0)), Black: 1886#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))), Black: 2078#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), Black: 2087#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (+ (* (div (+ ~M~0 ~q~0) 4294967296) 4294967296) ~p~0) (+ (* 4294967296 (div ~p~0 4294967296)) ~M~0 ~q~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1619#true, Black: 2066#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (and (< ~p~0 (+ ~q~0 1 (* (div (+ (* (- 1) ~q~0) ~p~0) 4294967296) 4294967296))) (< 0 (mod ~N~0 4294967296)))) (or (= (+ ~p~0 (* 4294967296 (div ~q~0 4294967296))) (+ (* 4294967296 (div ~p~0 4294967296)) ~q~0)) (< 0 (mod ~L~0 4294967296)))), Black: 684#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 136#true, 169#(<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0), 63#L99-4true, 2095#true, 665#(and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 1259#(and (= ~q~0 0) (or (and (< 0 (mod ~L~0 4294967296)) (= ~M~0 ~p~0)) (and (not (< 0 (mod ~L~0 4294967296))) (= ~p~0 0)))), Black: 1600#(and (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (or (not (< 0 (mod ~L~0 4294967296))) (and (< ~q~0 (+ (* (div (+ (* (- 1) ~p~0) ~q~0) 4294967296) 4294967296) ~p~0 1)) (< 0 (mod ~N~0 4294967296))))), Black: 1608#(and (<= ~q~0 ~p~0) (or (not (< 0 (mod ~L~0 4294967296))) (< 0 (mod ~N~0 4294967296))) (<= ~p~0 ~q~0) (or (and (= ~q~0 0) (<= ~M~0 ~p~0) (<= ~p~0 ~M~0)) (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))))), 672#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), 98#true, 1162#true, Black: 486#(or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), 686#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))), Black: 162#true, Black: 587#(and (= ~N~0 ~L~0) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 164#(= ~N~0 ~L~0), 650#(or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))), 41#L63-1true, Black: 490#(or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 166#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 275#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296)))) (and (< 1 (mod ~L~0 4294967296)) (= thread2Thread1of1ForFork0_~cond~1 1))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 1119#(and (= ~p~0 0) (or (< 0 (mod ~L~0 4294967296)) (and (not (< 1 (mod ~N~0 4294967296))) (< (+ (* 4294967296 (div ~p~0 4294967296)) (mod ~q~0 4294967296)) (+ ~p~0 1))))), Black: 591#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))))) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 167#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0)), Black: 693#(<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0), Black: 1113#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 599#(and (= thread2Thread1of1ForFork0_~cond~1 0) (not (< 1 (mod ~L~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 427#(or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 727#(= ~p~0 0), Black: 609#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 688#true, Black: 1123#(and (or (not (< 1 (mod ~N~0 4294967296))) (< 0 (mod ~L~0 4294967296))) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 603#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 762#(and (= ~N~0 ~L~0) (= ~p~0 0) (= ~q~0 0)), Black: 585#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 593#(and (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 1117#(and (<= (+ 2 (* 4294967296 (div ~L~0 4294967296))) ~L~0) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 601#(and (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 482#(or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 165#(and (= ~N~0 ~L~0) (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (= thread1Thread1of1ForFork2_~cond~0 1) (not (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)))))), Black: 168#(or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 116#(and (= ~N~0 ~L~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 597#(and (or (< 1 (mod ~N~0 4294967296)) (= (mod thread1Thread1of1ForFork2_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (not (<= (mod thread2Thread1of1ForFork0_~cond~1 256) 0)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (not (< 0 (mod ~N~0 4294967296))) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 605#(and (or (and (<= (div thread2Thread1of1ForFork0_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork0_~cond~1)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)) (or (< 1 (mod ~N~0 4294967296)) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0))), Black: 117#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 119#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 589#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 1146#(and (or (and (= thread2Thread1of1ForFork0_~cond~1 1) (not (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)))) (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork0_~cond~1 0))) (= ~N~0 ~L~0))]) [2022-12-11 20:03:49,201 INFO L382 tUnfolder$Statistics]: this new event has 51 ancestors and is cut-off event [2022-12-11 20:03:49,201 INFO L385 tUnfolder$Statistics]: existing Event has 49 ancestors and is cut-off event [2022-12-11 20:03:49,201 INFO L385 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-11 20:03:49,202 INFO L385 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-12-11 20:03:52,224 INFO L130 PetriNetUnfolder]: 12177/28485 cut-off events. [2022-12-11 20:03:52,224 INFO L131 PetriNetUnfolder]: For 482795/486451 co-relation queries the response was YES. [2022-12-11 20:03:52,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195466 conditions, 28485 events. 12177/28485 cut-off events. For 482795/486451 co-relation queries the response was YES. Maximal size of possible extension queue 2102. Compared 330664 event pairs, 966 based on Foata normal form. 1249/29279 useless extension candidates. Maximal degree in co-relation 195068. Up to 12445 conditions per place. [2022-12-11 20:03:52,652 INFO L137 encePairwiseOnDemand]: 76/92 looper letters, 670 selfloop transitions, 1136 changer transitions 22/1952 dead transitions. [2022-12-11 20:03:52,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1952 transitions, 45097 flow [2022-12-11 20:03:52,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-11 20:03:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-11 20:03:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 2824 transitions. [2022-12-11 20:03:52,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6976284584980237 [2022-12-11 20:03:52,655 INFO L175 Difference]: Start difference. First operand has 250 places, 1023 transitions, 21687 flow. Second operand 44 states and 2824 transitions. [2022-12-11 20:03:52,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1952 transitions, 45097 flow [2022-12-11 20:03:55,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 1952 transitions, 43279 flow, removed 556 selfloop flow, removed 13 redundant places. [2022-12-11 20:03:55,290 INFO L231 Difference]: Finished difference. Result has 305 places, 1794 transitions, 42205 flow [2022-12-11 20:03:55,291 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=20641, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=458, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=42205, PETRI_PLACES=305, PETRI_TRANSITIONS=1794} [2022-12-11 20:03:55,291 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 223 predicate places. [2022-12-11 20:03:55,291 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 1794 transitions, 42205 flow [2022-12-11 20:03:55,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 61.523809523809526) internal successors, (1292), 21 states have internal predecessors, (1292), 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) [2022-12-11 20:03:55,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:03:55,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:03:55,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-11 20:03:55,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-11 20:03:55,497 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 20:03:55,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:03:55,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1659647295, now seen corresponding path program 4 times [2022-12-11 20:03:55,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:03:55,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414956173] [2022-12-11 20:03:55,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:03:55,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:03:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:03:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:55,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:03:55,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414956173] [2022-12-11 20:03:55,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414956173] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:03:55,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889621593] [2022-12-11 20:03:55,782 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 20:03:55,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:03:55,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:03:55,784 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 20:03:55,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-11 20:03:55,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 20:03:55,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 20:03:55,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-11 20:03:55,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:03:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:56,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:03:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:03:56,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889621593] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:03:56,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:03:56,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2022-12-11 20:03:56,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748860336] [2022-12-11 20:03:56,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:03:56,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-11 20:03:56,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:03:56,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-11 20:03:56,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-12-11 20:03:56,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 92 [2022-12-11 20:03:56,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 1794 transitions, 42205 flow. Second operand has 19 states, 19 states have (on average 60.421052631578945) internal successors, (1148), 19 states have internal predecessors, (1148), 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) [2022-12-11 20:03:56,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:03:56,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 92 [2022-12-11 20:03:56,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:04:06,773 INFO L130 PetriNetUnfolder]: 12825/30205 cut-off events. [2022-12-11 20:04:06,773 INFO L131 PetriNetUnfolder]: For 616123/618609 co-relation queries the response was YES. [2022-12-11 20:04:07,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225899 conditions, 30205 events. 12825/30205 cut-off events. For 616123/618609 co-relation queries the response was YES. Maximal size of possible extension queue 2309. Compared 354517 event pairs, 1286 based on Foata normal form. 885/30600 useless extension candidates. Maximal degree in co-relation 225607. Up to 15435 conditions per place. [2022-12-11 20:04:07,474 INFO L137 encePairwiseOnDemand]: 77/92 looper letters, 1266 selfloop transitions, 882 changer transitions 18/2266 dead transitions. [2022-12-11 20:04:07,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 2266 transitions, 56846 flow [2022-12-11 20:04:07,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-11 20:04:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-11 20:04:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1340 transitions. [2022-12-11 20:04:07,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6935817805383023 [2022-12-11 20:04:07,476 INFO L175 Difference]: Start difference. First operand has 305 places, 1794 transitions, 42205 flow. Second operand 21 states and 1340 transitions. [2022-12-11 20:04:07,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 2266 transitions, 56846 flow [2022-12-11 20:04:13,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 2266 transitions, 55102 flow, removed 837 selfloop flow, removed 11 redundant places. [2022-12-11 20:04:13,423 INFO L231 Difference]: Finished difference. Result has 315 places, 2017 transitions, 49025 flow [2022-12-11 20:04:13,425 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=40799, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=673, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=49025, PETRI_PLACES=315, PETRI_TRANSITIONS=2017} [2022-12-11 20:04:13,425 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 233 predicate places. [2022-12-11 20:04:13,425 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 2017 transitions, 49025 flow [2022-12-11 20:04:13,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 60.421052631578945) internal successors, (1148), 19 states have internal predecessors, (1148), 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) [2022-12-11 20:04:13,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:04:13,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:04:13,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-11 20:04:13,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-11 20:04:13,631 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 20:04:13,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:04:13,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1909075257, now seen corresponding path program 1 times [2022-12-11 20:04:13,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:04:13,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116120426] [2022-12-11 20:04:13,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:04:13,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:04:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:04:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:04:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:04:13,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116120426] [2022-12-11 20:04:13,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116120426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:04:13,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534814628] [2022-12-11 20:04:13,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:04:13,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:04:13,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:04:13,773 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 20:04:13,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-11 20:04:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:04:13,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-11 20:04:13,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:04:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:04:13,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:04:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:04:14,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534814628] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:04:14,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:04:14,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 11] total 17 [2022-12-11 20:04:14,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628705758] [2022-12-11 20:04:14,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:04:14,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-11 20:04:14,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:04:14,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-11 20:04:14,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-11 20:04:14,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 92 [2022-12-11 20:04:14,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 2017 transitions, 49025 flow. Second operand has 17 states, 17 states have (on average 66.29411764705883) internal successors, (1127), 17 states have internal predecessors, (1127), 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) [2022-12-11 20:04:14,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:04:14,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 92 [2022-12-11 20:04:14,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:04:37,731 INFO L130 PetriNetUnfolder]: 23544/51998 cut-off events. [2022-12-11 20:04:37,731 INFO L131 PetriNetUnfolder]: For 1034467/1034566 co-relation queries the response was YES. [2022-12-11 20:04:38,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386408 conditions, 51998 events. 23544/51998 cut-off events. For 1034467/1034566 co-relation queries the response was YES. Maximal size of possible extension queue 3708. Compared 624619 event pairs, 365 based on Foata normal form. 676/52506 useless extension candidates. Maximal degree in co-relation 385781. Up to 10979 conditions per place. [2022-12-11 20:04:38,684 INFO L137 encePairwiseOnDemand]: 74/92 looper letters, 1426 selfloop transitions, 3784 changer transitions 11/5272 dead transitions. [2022-12-11 20:04:38,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 5272 transitions, 124619 flow [2022-12-11 20:04:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-12-11 20:04:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2022-12-11 20:04:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 7235 transitions. [2022-12-11 20:04:38,691 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7709931798806479 [2022-12-11 20:04:38,692 INFO L175 Difference]: Start difference. First operand has 315 places, 2017 transitions, 49025 flow. Second operand 102 states and 7235 transitions. [2022-12-11 20:04:38,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 5272 transitions, 124619 flow [2022-12-11 20:04:50,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 5272 transitions, 123974 flow, removed 174 selfloop flow, removed 10 redundant places. [2022-12-11 20:04:51,021 INFO L231 Difference]: Finished difference. Result has 450 places, 4540 transitions, 116100 flow [2022-12-11 20:04:51,022 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=47135, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1969, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1513, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=102, PETRI_FLOW=116100, PETRI_PLACES=450, PETRI_TRANSITIONS=4540} [2022-12-11 20:04:51,023 INFO L295 CegarLoopForPetriNet]: 82 programPoint places, 368 predicate places. [2022-12-11 20:04:51,023 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 4540 transitions, 116100 flow [2022-12-11 20:04:51,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 66.29411764705883) internal successors, (1127), 17 states have internal predecessors, (1127), 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) [2022-12-11 20:04:51,023 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:04:51,023 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:04:51,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-11 20:04:51,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:04:51,228 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 20:04:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:04:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash -936382673, now seen corresponding path program 2 times [2022-12-11 20:04:51,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:04:51,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988358514] [2022-12-11 20:04:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:04:51,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:04:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:04:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:04:51,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:04:51,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988358514] [2022-12-11 20:04:51,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988358514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 20:04:51,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375568264] [2022-12-11 20:04:51,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 20:04:51,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 20:04:51,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:04:51,404 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 20:04:51,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-11 20:04:51,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 20:04:51,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 20:04:51,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-11 20:04:51,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 20:04:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:04:51,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 20:04:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:04:51,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375568264] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 20:04:51,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 20:04:51,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 23 [2022-12-11 20:04:51,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909138034] [2022-12-11 20:04:51,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 20:04:51,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-11 20:04:51,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:04:51,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-11 20:04:51,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-12-11 20:04:51,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 92 [2022-12-11 20:04:51,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 4540 transitions, 116100 flow. Second operand has 23 states, 23 states have (on average 65.8695652173913) internal successors, (1515), 23 states have internal predecessors, (1515), 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) [2022-12-11 20:04:51,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:04:51,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 92 [2022-12-11 20:04:51,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand