/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:42:42,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:42:42,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:42:42,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:42:42,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:42:42,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:42:42,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:42:42,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:42:42,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:42:42,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:42:42,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:42:42,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:42:42,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:42:42,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:42:42,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:42:42,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:42:42,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:42:42,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:42:42,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:42:42,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:42:42,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:42:42,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:42:42,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:42:42,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:42:42,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:42:42,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:42:42,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:42:42,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:42:42,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:42:42,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:42:42,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:42:42,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:42:42,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:42:42,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:42:42,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:42:42,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:42:42,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:42:42,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:42:42,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:42:42,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:42:42,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:42:42,724 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:42:42,762 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:42:42,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:42:42,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:42:42,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:42:42,765 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:42:42,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:42:42,765 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:42:42,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:42:42,766 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:42:42,766 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:42:42,766 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:42:42,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:42:42,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:42:42,767 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:42:42,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:42:42,767 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:42:42,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:42:42,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:42:42,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:42:42,767 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:42:42,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:42:42,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:42:42,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:42:42,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:42:42,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:42:42,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:42:42,768 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:42:42,768 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:42:42,768 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-13 11:42:43,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:42:43,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:42:43,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:42:43,054 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:42:43,054 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:42:43,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2022-12-13 11:42:44,016 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:42:44,205 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:42:44,205 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2022-12-13 11:42:44,217 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09af3e9c0/1d7ee5bf330d4840831a7b30b8107848/FLAGd25da174e [2022-12-13 11:42:44,226 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09af3e9c0/1d7ee5bf330d4840831a7b30b8107848 [2022-12-13 11:42:44,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:42:44,229 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:42:44,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:42:44,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:42:44,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:42:44,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209516ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44, skipping insertion in model container [2022-12-13 11:42:44,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:42:44,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:42:44,498 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2022-12-13 11:42:44,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:42:44,522 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:42:44,551 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2022-12-13 11:42:44,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:42:44,608 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:42:44,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44 WrapperNode [2022-12-13 11:42:44,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:42:44,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:42:44,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:42:44,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:42:44,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,643 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-13 11:42:44,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:42:44,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:42:44,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:42:44,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:42:44,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:42:44,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:42:44,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:42:44,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:42:44,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (1/1) ... [2022-12-13 11:42:44,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:42:44,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:42:44,709 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-13 11:42:44,727 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-13 11:42:44,738 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-13 11:42:44,739 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-13 11:42:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-13 11:42:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-13 11:42:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:42:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:42:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:42:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:42:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 11:42:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:42:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:42:44,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:42:44,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:42:44,742 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:42:44,872 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:42:44,873 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:42:45,078 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:42:45,087 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:42:45,087 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 11:42:45,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:42:45 BoogieIcfgContainer [2022-12-13 11:42:45,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:42:45,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:42:45,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:42:45,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:42:45,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:42:44" (1/3) ... [2022-12-13 11:42:45,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a831e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:42:45, skipping insertion in model container [2022-12-13 11:42:45,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:42:44" (2/3) ... [2022-12-13 11:42:45,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a831e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:42:45, skipping insertion in model container [2022-12-13 11:42:45,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:42:45" (3/3) ... [2022-12-13 11:42:45,096 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-12-13 11:42:45,124 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:42:45,125 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:42:45,125 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:42:45,214 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 11:42:45,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-13 11:42:45,317 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-13 11:42:45,318 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 11:42:45,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 10/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-13 11:42:45,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-13 11:42:45,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-13 11:42:45,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:45,353 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-13 11:42:45,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 287 flow [2022-12-13 11:42:45,399 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-13 11:42:45,400 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 11:42:45,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 139 events. 10/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 307 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-13 11:42:45,406 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-13 11:42:45,406 INFO L226 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-13 11:42:49,668 INFO L241 LiptonReduction]: Total number of compositions: 116 [2022-12-13 11:42:49,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:42:49,682 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=REPEATED_LIPTON_PN, 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;@27dbfb22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:42:49,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:42:49,697 INFO L130 PetriNetUnfolder]: 1/55 cut-off events. [2022-12-13 11:42:49,697 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 11:42:49,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:42:49,698 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 11:42:49,698 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:42:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:42:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1688471119, now seen corresponding path program 1 times [2022-12-13 11:42:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:42:49,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491385490] [2022-12-13 11:42:49,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:49,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:42:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:49,885 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-13 11:42:49,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:42:49,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491385490] [2022-12-13 11:42:49,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491385490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:42:49,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:42:49,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:42:49,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637300847] [2022-12-13 11:42:49,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:42:49,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:42:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:42:49,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:42:49,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:42:49,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-13 11:42:49,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-13 11:42:49,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:42:49,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-13 11:42:49,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:42:51,042 INFO L130 PetriNetUnfolder]: 12108/20257 cut-off events. [2022-12-13 11:42:51,042 INFO L131 PetriNetUnfolder]: For 196/196 co-relation queries the response was YES. [2022-12-13 11:42:51,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39810 conditions, 20257 events. 12108/20257 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 148702 event pairs, 5729 based on Foata normal form. 0/6684 useless extension candidates. Maximal degree in co-relation 39251. Up to 12849 conditions per place. [2022-12-13 11:42:51,132 INFO L137 encePairwiseOnDemand]: 89/110 looper letters, 149 selfloop transitions, 8 changer transitions 2/171 dead transitions. [2022-12-13 11:42:51,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 171 transitions, 675 flow [2022-12-13 11:42:51,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:42:51,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:42:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2022-12-13 11:42:51,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2022-12-13 11:42:51,141 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 229 flow. Second operand 3 states and 212 transitions. [2022-12-13 11:42:51,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 171 transitions, 675 flow [2022-12-13 11:42:51,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 171 transitions, 667 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:42:51,149 INFO L231 Difference]: Finished difference. Result has 107 places, 108 transitions, 270 flow [2022-12-13 11:42:51,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=107, PETRI_TRANSITIONS=108} [2022-12-13 11:42:51,153 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2022-12-13 11:42:51,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:42:51,154 INFO L89 Accepts]: Start accepts. Operand has 107 places, 108 transitions, 270 flow [2022-12-13 11:42:51,157 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:42:51,157 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:51,157 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 108 transitions, 270 flow [2022-12-13 11:42:51,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 108 transitions, 270 flow [2022-12-13 11:42:51,197 INFO L130 PetriNetUnfolder]: 105/641 cut-off events. [2022-12-13 11:42:51,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:42:51,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 641 events. 105/641 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4995 event pairs, 10 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 807. Up to 141 conditions per place. [2022-12-13 11:42:51,207 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 108 transitions, 270 flow [2022-12-13 11:42:51,207 INFO L226 LiptonReduction]: Number of co-enabled transitions 5408 [2022-12-13 11:42:51,265 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:42:51,267 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 11:42:51,267 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 108 transitions, 270 flow [2022-12-13 11:42:51,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-13 11:42:51,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:42:51,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:42:51,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:42:51,268 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:42:51,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:42:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash 603354056, now seen corresponding path program 1 times [2022-12-13 11:42:51,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:42:51,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867305131] [2022-12-13 11:42:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:42:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:51,335 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-13 11:42:51,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:42:51,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867305131] [2022-12-13 11:42:51,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867305131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:42:51,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:42:51,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:42:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12685589] [2022-12-13 11:42:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:42:51,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:42:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:42:51,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:42:51,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:42:51,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 104 [2022-12-13 11:42:51,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 108 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 11:42:51,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:42:51,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 104 [2022-12-13 11:42:51,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:42:52,352 INFO L130 PetriNetUnfolder]: 11932/20366 cut-off events. [2022-12-13 11:42:52,352 INFO L131 PetriNetUnfolder]: For 342/369 co-relation queries the response was YES. [2022-12-13 11:42:52,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41436 conditions, 20366 events. 11932/20366 cut-off events. For 342/369 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 157941 event pairs, 9139 based on Foata normal form. 13/7209 useless extension candidates. Maximal degree in co-relation 36843. Up to 17512 conditions per place. [2022-12-13 11:42:52,401 INFO L137 encePairwiseOnDemand]: 95/104 looper letters, 131 selfloop transitions, 7 changer transitions 0/156 dead transitions. [2022-12-13 11:42:52,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 156 transitions, 661 flow [2022-12-13 11:42:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:42:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:42:52,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-12-13 11:42:52,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-13 11:42:52,403 INFO L175 Difference]: Start difference. First operand has 105 places, 108 transitions, 270 flow. Second operand 3 states and 189 transitions. [2022-12-13 11:42:52,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 156 transitions, 661 flow [2022-12-13 11:42:52,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 156 transitions, 650 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:42:52,415 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 309 flow [2022-12-13 11:42:52,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2022-12-13 11:42:52,416 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -4 predicate places. [2022-12-13 11:42:52,416 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:42:52,416 INFO L89 Accepts]: Start accepts. Operand has 107 places, 113 transitions, 309 flow [2022-12-13 11:42:52,417 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:42:52,417 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:52,418 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 113 transitions, 309 flow [2022-12-13 11:42:52,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 113 transitions, 309 flow [2022-12-13 11:42:52,444 INFO L130 PetriNetUnfolder]: 124/726 cut-off events. [2022-12-13 11:42:52,444 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-13 11:42:52,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 726 events. 124/726 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5863 event pairs, 15 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 955. Up to 151 conditions per place. [2022-12-13 11:42:52,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 113 transitions, 309 flow [2022-12-13 11:42:52,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 5928 [2022-12-13 11:42:52,465 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:42:52,466 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 11:42:52,467 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 309 flow [2022-12-13 11:42:52,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 11:42:52,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:42:52,467 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:42:52,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:42:52,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:42:52,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:42:52,468 INFO L85 PathProgramCache]: Analyzing trace with hash 85783273, now seen corresponding path program 1 times [2022-12-13 11:42:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:42:52,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653035615] [2022-12-13 11:42:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:42:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:42:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:42:52,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653035615] [2022-12-13 11:42:52,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653035615] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:42:52,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110793132] [2022-12-13 11:42:52,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:52,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:42:52,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:42:52,549 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-13 11:42:52,575 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-13 11:42:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:52,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 11:42:52,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:42:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:42:52,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:42:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:42:52,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110793132] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:42:52,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:42:52,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 11:42:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989697577] [2022-12-13 11:42:52,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:42:52,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:42:52,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:42:52,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:42:52,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:42:52,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 104 [2022-12-13 11:42:52,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 113 transitions, 309 flow. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 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-13 11:42:52,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:42:52,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 104 [2022-12-13 11:42:52,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:42:55,542 INFO L130 PetriNetUnfolder]: 29463/48122 cut-off events. [2022-12-13 11:42:55,542 INFO L131 PetriNetUnfolder]: For 3749/3749 co-relation queries the response was YES. [2022-12-13 11:42:55,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106727 conditions, 48122 events. 29463/48122 cut-off events. For 3749/3749 co-relation queries the response was YES. Maximal size of possible extension queue 1875. Compared 380788 event pairs, 4471 based on Foata normal form. 372/18353 useless extension candidates. Maximal degree in co-relation 100000. Up to 14903 conditions per place. [2022-12-13 11:42:55,693 INFO L137 encePairwiseOnDemand]: 82/104 looper letters, 494 selfloop transitions, 77 changer transitions 173/756 dead transitions. [2022-12-13 11:42:55,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 756 transitions, 3425 flow [2022-12-13 11:42:55,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 11:42:55,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 11:42:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 989 transitions. [2022-12-13 11:42:55,696 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5005060728744939 [2022-12-13 11:42:55,696 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 309 flow. Second operand 19 states and 989 transitions. [2022-12-13 11:42:55,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 756 transitions, 3425 flow [2022-12-13 11:42:55,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 756 transitions, 3390 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:42:55,722 INFO L231 Difference]: Finished difference. Result has 138 places, 188 transitions, 951 flow [2022-12-13 11:42:55,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=104, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=951, PETRI_PLACES=138, PETRI_TRANSITIONS=188} [2022-12-13 11:42:55,723 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 27 predicate places. [2022-12-13 11:42:55,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:42:55,723 INFO L89 Accepts]: Start accepts. Operand has 138 places, 188 transitions, 951 flow [2022-12-13 11:42:55,725 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:42:55,725 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:55,725 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 188 transitions, 951 flow [2022-12-13 11:42:55,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 188 transitions, 951 flow [2022-12-13 11:42:55,945 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][49], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), 242#(<= ~top~0 0), 135#L1008-1true, Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 222#true, 23#L1022-4true]) [2022-12-13 11:42:55,946 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,946 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,946 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,946 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,946 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][49], [154#true, Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), 242#(<= ~top~0 0), 135#L1008-1true, Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,946 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,946 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,946 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,947 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,947 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][49], [114#L996-2true, Black: 228#(= ~top~0 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), 242#(<= ~top~0 0), 135#L1008-1true, Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 11:42:55,947 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,947 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,947 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,947 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,947 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][85], [Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 222#true, 23#L1022-4true]) [2022-12-13 11:42:55,947 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,947 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,947 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,948 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,948 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1008-->L1010-1: Formula: (and (= |v_~#arr~0.offset_26| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|) (< 0 v_~top~0_146) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23| |v_~#arr~0.base_31|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_26|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_26|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][86], [Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 222#true, 23#L1022-4true]) [2022-12-13 11:42:55,948 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,948 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,948 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,948 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,948 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([635] L1008-->L1010-2: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25| |v_~#arr~0.base_33|) (= |v_~#arr~0.offset_28| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|) (< 0 v_~top~0_148)) InVars {~#arr~0.offset=|v_~#arr~0.offset_28|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_28|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_59|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][87], [Black: 228#(= ~top~0 0), 164#true, 283#(not (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 222#true, 23#L1022-4true]) [2022-12-13 11:42:55,951 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,956 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,956 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,956 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,956 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][88], [Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 38#L973true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 222#true, 23#L1022-4true]) [2022-12-13 11:42:55,956 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,956 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,956 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,956 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,957 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1008-->L975: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_67| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_~#arr~0.offset_34| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_t2Thread1of1ForFork0_pop_~stack#1.base_67|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_~#arr~0.base_39|) (< 0 v_~top~0_182)) InVars {~#arr~0.offset=|v_~#arr~0.offset_34|, ~top~0=v_~top~0_182, ~#arr~0.base=|v_~#arr~0.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_67|, ~#arr~0.offset=|v_~#arr~0.offset_34|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_49|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_67|, ~top~0=v_~top~0_182, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_67|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_71|, ~#arr~0.base=|v_~#arr~0.base_39|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][89], [Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 196#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 222#true, 23#L1022-4true]) [2022-12-13 11:42:55,957 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,957 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,957 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,957 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,958 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][85], [154#true, Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,958 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,958 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,958 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,958 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,960 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1008-->L1010-1: Formula: (and (= |v_~#arr~0.offset_26| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|) (< 0 v_~top~0_146) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23| |v_~#arr~0.base_31|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_26|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_26|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][86], [154#true, Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,960 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,960 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,960 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,960 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,960 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([635] L1008-->L1010-2: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25| |v_~#arr~0.base_33|) (= |v_~#arr~0.offset_28| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|) (< 0 v_~top~0_148)) InVars {~#arr~0.offset=|v_~#arr~0.offset_28|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_28|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_59|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][87], [154#true, Black: 228#(= ~top~0 0), 164#true, 283#(not (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,960 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,960 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,961 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,961 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,961 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][88], [154#true, Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 38#L973true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,961 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,961 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,961 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,961 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,961 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1008-->L975: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_67| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_~#arr~0.offset_34| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_t2Thread1of1ForFork0_pop_~stack#1.base_67|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_~#arr~0.base_39|) (< 0 v_~top~0_182)) InVars {~#arr~0.offset=|v_~#arr~0.offset_34|, ~top~0=v_~top~0_182, ~#arr~0.base=|v_~#arr~0.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_67|, ~#arr~0.offset=|v_~#arr~0.offset_34|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_49|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_67|, ~top~0=v_~top~0_182, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_67|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_71|, ~#arr~0.base=|v_~#arr~0.base_39|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][89], [154#true, Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 196#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,961 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,961 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,961 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,961 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,962 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][85], [114#L996-2true, Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 11:42:55,962 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,962 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,962 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,962 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,962 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1008-->L1010-1: Formula: (and (= |v_~#arr~0.offset_26| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|) (< 0 v_~top~0_146) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23| |v_~#arr~0.base_31|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_26|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_26|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][86], [114#L996-2true, Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 11:42:55,962 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,962 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,962 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,962 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,962 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([635] L1008-->L1010-2: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25| |v_~#arr~0.base_33|) (= |v_~#arr~0.offset_28| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|) (< 0 v_~top~0_148)) InVars {~#arr~0.offset=|v_~#arr~0.offset_28|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_28|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_59|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][87], [114#L996-2true, Black: 228#(= ~top~0 0), 164#true, 283#(not (<= 800 ~top~0)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 11:42:55,963 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,963 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,963 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,963 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,963 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][88], [114#L996-2true, Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), 38#L973true, Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 11:42:55,963 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,963 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,963 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,963 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,963 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1008-->L975: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_67| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_~#arr~0.offset_34| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_t2Thread1of1ForFork0_pop_~stack#1.base_67|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_~#arr~0.base_39|) (< 0 v_~top~0_182)) InVars {~#arr~0.offset=|v_~#arr~0.offset_34|, ~top~0=v_~top~0_182, ~#arr~0.base=|v_~#arr~0.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_67|, ~#arr~0.offset=|v_~#arr~0.offset_34|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_49|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_67|, ~top~0=v_~top~0_182, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_67|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_71|, ~#arr~0.base=|v_~#arr~0.base_39|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][89], [114#L996-2true, Black: 228#(= ~top~0 0), 283#(not (<= 800 ~top~0)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 196#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true, 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0)]) [2022-12-13 11:42:55,963 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,964 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,964 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,964 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,964 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][85], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,964 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,964 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,964 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,964 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,964 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1008-->L1010-1: Formula: (and (= |v_~#arr~0.offset_26| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|) (< 0 v_~top~0_146) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23| |v_~#arr~0.base_31|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_26|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_26|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][86], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,964 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,964 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,964 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,964 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,965 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([635] L1008-->L1010-2: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25| |v_~#arr~0.base_33|) (= |v_~#arr~0.offset_28| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|) (< 0 v_~top~0_148)) InVars {~#arr~0.offset=|v_~#arr~0.offset_28|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_28|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_59|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][87], [Black: 228#(= ~top~0 0), 164#true, Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 184#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,965 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,965 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,965 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,965 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,965 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][88], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), 38#L973true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 184#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,965 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,965 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,965 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,965 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,966 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1008-->L975: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_67| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_~#arr~0.offset_34| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_t2Thread1of1ForFork0_pop_~stack#1.base_67|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_~#arr~0.base_39|) (< 0 v_~top~0_182)) InVars {~#arr~0.offset=|v_~#arr~0.offset_34|, ~top~0=v_~top~0_182, ~#arr~0.base=|v_~#arr~0.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_67|, ~#arr~0.offset=|v_~#arr~0.offset_34|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_49|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_67|, ~top~0=v_~top~0_182, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_67|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_71|, ~#arr~0.base=|v_~#arr~0.base_39|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][89], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 184#true, 196#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,966 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,966 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 11:42:55,966 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:42:55,966 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 11:42:55,979 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][49], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), 242#(<= ~top~0 0), 135#L1008-1true, 123#L945-1true, Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,980 INFO L382 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 11:42:55,980 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:55,980 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 11:42:55,980 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 11:42:55,988 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][51], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 234#true, Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), 242#(<= ~top~0 0), 135#L1008-1true, Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,988 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 11:42:55,988 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,989 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 11:42:55,989 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:55,989 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][85], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 234#true, 219#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 184#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,989 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 11:42:55,989 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,989 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 11:42:55,989 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:55,989 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([634] L1008-->L1010-1: Formula: (and (= |v_~#arr~0.offset_26| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|) (< 0 v_~top~0_146) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23| |v_~#arr~0.base_31|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_26|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_26|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_23|, ~top~0=v_~top~0_146, ~#arr~0.base=|v_~#arr~0.base_31|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_23|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][86], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 234#true, 197#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), 184#true, Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,989 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 11:42:55,989 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,989 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 11:42:55,989 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:55,989 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([635] L1008-->L1010-2: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25| |v_~#arr~0.base_33|) (= |v_~#arr~0.offset_28| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|) (< 0 v_~top~0_148)) InVars {~#arr~0.offset=|v_~#arr~0.offset_28|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_28|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_59|, ~top~0=v_~top~0_148, ~#arr~0.base=|v_~#arr~0.base_33|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_25|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][87], [Black: 228#(= ~top~0 0), 164#true, Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 234#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,990 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 11:42:55,990 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,990 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 11:42:55,990 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:55,990 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base][88], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 234#true, 38#L973true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 23#L1022-4true]) [2022-12-13 11:42:55,990 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 11:42:55,990 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,990 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 11:42:55,990 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:55,990 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1008-->L975: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_67| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_~#arr~0.offset_34| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_t2Thread1of1ForFork0_pop_~stack#1.base_67|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41| |v_~#arr~0.base_39|) (< 0 v_~top~0_182)) InVars {~#arr~0.offset=|v_~#arr~0.offset_34|, ~top~0=v_~top~0_182, ~#arr~0.base=|v_~#arr~0.base_39|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_67|, ~#arr~0.offset=|v_~#arr~0.offset_34|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_49|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_41|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_67|, ~top~0=v_~top~0_182, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_67|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_71|, ~#arr~0.base=|v_~#arr~0.base_39|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_41|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_#in~stack#1.base][89], [Black: 228#(= ~top~0 0), Black: 232#(= |t1Thread1of1ForFork1_#t~ret41#1| 0), 234#true, Black: 323#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 1)), Black: 319#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 1)), Black: 283#(not (<= 800 ~top~0)), Black: 325#(and (not (<= 800 ~top~0)) (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799)), t2Thread1of1ForFork0InUse, Black: 321#(and (= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0) (<= ~top~0 0)), Black: 331#(and (<= ~top~0 1) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 237#(= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), Black: 329#(and (< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799) (<= ~top~0 0)), Black: 242#(<= ~top~0 0), Black: 238#(<= ~top~0 1), Black: 264#(<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0), 184#true, Black: 327#(and (<= ~top~0 0) (<= |t1Thread1of1ForFork1_inc_top_#t~post31#1| 0)), Black: 293#(< |t1Thread1of1ForFork1_inc_top_#t~post31#1| 799), 196#true, 23#L1022-4true]) [2022-12-13 11:42:55,990 INFO L382 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 11:42:55,990 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 11:42:55,990 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 11:42:55,991 INFO L385 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 11:42:55,999 INFO L130 PetriNetUnfolder]: 558/2375 cut-off events. [2022-12-13 11:42:55,999 INFO L131 PetriNetUnfolder]: For 2103/2190 co-relation queries the response was YES. [2022-12-13 11:42:56,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 2375 events. 558/2375 cut-off events. For 2103/2190 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22936 event pairs, 40 based on Foata normal form. 1/701 useless extension candidates. Maximal degree in co-relation 5506. Up to 596 conditions per place. [2022-12-13 11:42:56,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 188 transitions, 951 flow [2022-12-13 11:42:56,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 8924 [2022-12-13 11:42:56,050 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [412] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[] [2022-12-13 11:42:56,058 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [463] L949-1-->L947: Formula: (= (+ v_~top~0_17 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_14|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_14|} OutVars{~top~0=v_~top~0_17} AuxVars[] AssignedVars[t2Thread1of1ForFork0_dec_top_#t~post32#1, ~top~0] [2022-12-13 11:42:56,066 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [609] L973-->L978: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_49| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_19|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_19| |v_t2Thread1of1ForFork0_pop_~stack#1.base_49|) (= v_~top~0_125 0)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_19|, ~top~0=v_~top~0_125, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_19|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_49|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_13|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_19|, ~top~0=v_~top~0_125, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_49|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_19|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_~stack#1.offset] [2022-12-13 11:42:56,084 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [428] L949-1-->L949-2: Formula: (= (+ v_~top~0_11 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5|} OutVars{t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5|, ~top~0=v_~top~0_11} AuxVars[] AssignedVars[~top~0] [2022-12-13 11:42:56,093 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [610] L973-->pop_returnLabel#1: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_51| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_21|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_35|) 0) (= v_~top~0_127 0) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_21| |v_t2Thread1of1ForFork0_pop_~stack#1.base_51|)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_21|, ~top~0=v_~top~0_127, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_21|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_51|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_15|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_21|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_35|, ~top~0=v_~top~0_127, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_51|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_21|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset] [2022-12-13 11:42:56,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [581] L949-1-->L953: Formula: (= (+ v_~top~0_120 1) |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_52|) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_52|} OutVars{t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_29|, ~top~0=v_~top~0_120} AuxVars[] AssignedVars[t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, ~top~0] [2022-12-13 11:42:56,156 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [394] L945-->L945-1: Formula: (= |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3| v_~top~0_5) InVars {~top~0=v_~top~0_5} OutVars{~top~0=v_~top~0_5, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_3|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [547] L973-->L977: Formula: (and (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_9| |v_t2Thread1of1ForFork0_pop_~stack#1.offset_35|) (= v_~top~0_70 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_35| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_9|)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_9|, ~top~0=v_~top~0_70, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_9|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_9|, ~top~0=v_~top~0_70, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_9|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_~stack#1.offset] [2022-12-13 11:42:56,290 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:42:56,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 568 [2022-12-13 11:42:56,291 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 186 transitions, 1023 flow [2022-12-13 11:42:56,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 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-13 11:42:56,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:42:56,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:42:56,298 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-13 11:42:56,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:42:56,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:42:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:42:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2022799586, now seen corresponding path program 1 times [2022-12-13 11:42:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:42:56,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852683077] [2022-12-13 11:42:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:42:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:42:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:42:56,526 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-13 11:42:56,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:42:56,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852683077] [2022-12-13 11:42:56,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852683077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:42:56,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:42:56,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:42:56,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219933841] [2022-12-13 11:42:56,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:42:56,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 11:42:56,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:42:56,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 11:42:56,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:42:56,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 124 [2022-12-13 11:42:56,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 186 transitions, 1023 flow. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-13 11:42:56,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:42:56,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 124 [2022-12-13 11:42:56,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:42:59,370 INFO L130 PetriNetUnfolder]: 26034/43850 cut-off events. [2022-12-13 11:42:59,370 INFO L131 PetriNetUnfolder]: For 28225/30020 co-relation queries the response was YES. [2022-12-13 11:42:59,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111083 conditions, 43850 events. 26034/43850 cut-off events. For 28225/30020 co-relation queries the response was YES. Maximal size of possible extension queue 1914. Compared 369578 event pairs, 20881 based on Foata normal form. 244/17443 useless extension candidates. Maximal degree in co-relation 104084. Up to 40583 conditions per place. [2022-12-13 11:42:59,609 INFO L137 encePairwiseOnDemand]: 119/124 looper letters, 147 selfloop transitions, 0 changer transitions 0/181 dead transitions. [2022-12-13 11:42:59,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 181 transitions, 1242 flow [2022-12-13 11:42:59,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 11:42:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 11:42:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2022-12-13 11:42:59,610 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5725806451612904 [2022-12-13 11:42:59,610 INFO L175 Difference]: Start difference. First operand has 135 places, 186 transitions, 1023 flow. Second operand 2 states and 142 transitions. [2022-12-13 11:42:59,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 181 transitions, 1242 flow [2022-12-13 11:42:59,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 181 transitions, 1138 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-12-13 11:42:59,903 INFO L231 Difference]: Finished difference. Result has 132 places, 181 transitions, 844 flow [2022-12-13 11:42:59,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=844, PETRI_PLACES=132, PETRI_TRANSITIONS=181} [2022-12-13 11:42:59,903 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 21 predicate places. [2022-12-13 11:42:59,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:42:59,904 INFO L89 Accepts]: Start accepts. Operand has 132 places, 181 transitions, 844 flow [2022-12-13 11:42:59,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:42:59,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:42:59,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 181 transitions, 844 flow [2022-12-13 11:42:59,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 181 transitions, 844 flow [2022-12-13 11:43:00,131 INFO L130 PetriNetUnfolder]: 483/2294 cut-off events. [2022-12-13 11:43:00,132 INFO L131 PetriNetUnfolder]: For 1527/1601 co-relation queries the response was YES. [2022-12-13 11:43:00,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4637 conditions, 2294 events. 483/2294 cut-off events. For 1527/1601 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 23058 event pairs, 40 based on Foata normal form. 1/674 useless extension candidates. Maximal degree in co-relation 4610. Up to 529 conditions per place. [2022-12-13 11:43:00,147 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 181 transitions, 844 flow [2022-12-13 11:43:00,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 8574 [2022-12-13 11:43:00,162 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [670] L945-->pop_returnLabel#1: Formula: (and (= v_~top~0_434 0) (= v_~top~0_434 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_271|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_85|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_104| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_72|) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_104| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_72|)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_72|, ~top~0=v_~top~0_434, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_72|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_104|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_39|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_72|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_85|, ~top~0=v_~top~0_434, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_104|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_72|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_271|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-13 11:43:00,167 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [674] L945-->L977: Formula: (and (= v_~top~0_448 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_106| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_74|) (= v_~top~0_448 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_281|) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_106| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_74|)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_74|, ~top~0=v_~top~0_448, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_74|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_106|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_74|, ~top~0=v_~top~0_448, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_106|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_74|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_281|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_~stack#1.offset, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-13 11:43:00,171 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [636] L1008-->L973: Formula: (and (= |v_~#arr~0.offset_30| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|) (< 0 v_~top~0_150) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27| |v_~#arr~0.base_35|)) InVars {~#arr~0.offset=|v_~#arr~0.offset_30|, ~top~0=v_~top~0_150, ~#arr~0.base=|v_~#arr~0.base_35|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_53|, ~#arr~0.offset=|v_~#arr~0.offset_30|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_45|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_17|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_27|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_61|, ~top~0=v_~top~0_150, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_67|, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_53|, ~#arr~0.base=|v_~#arr~0.base_35|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_27|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [667] L945-->L978: Formula: (and (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_102| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_70|) (= v_~top~0_424 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_263|) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_102| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_70|) (= v_~top~0_424 0)) InVars {t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_70|, ~top~0=v_~top~0_424, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_70|} OutVars{t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_102|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_37|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_70|, ~top~0=v_~top~0_424, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_102|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_70|, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_263|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t1Thread1of1ForFork1_inc_top_#t~post31#1] [2022-12-13 11:43:00,181 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:43:00,182 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-13 11:43:00,182 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 181 transitions, 856 flow [2022-12-13 11:43:00,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-13 11:43:00,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:00,182 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] [2022-12-13 11:43:00,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:43:00,183 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:43:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash -979973897, now seen corresponding path program 1 times [2022-12-13 11:43:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:00,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249093671] [2022-12-13 11:43:00,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:00,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:00,295 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-13 11:43:00,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:00,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249093671] [2022-12-13 11:43:00,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249093671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:00,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:00,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:43:00,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499381617] [2022-12-13 11:43:00,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:00,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:43:00,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:00,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:43:00,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:43:00,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 119 [2022-12-13 11:43:00,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 181 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-13 11:43:00,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:00,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 119 [2022-12-13 11:43:00,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:01,145 INFO L130 PetriNetUnfolder]: 8437/15041 cut-off events. [2022-12-13 11:43:01,145 INFO L131 PetriNetUnfolder]: For 3552/3552 co-relation queries the response was YES. [2022-12-13 11:43:01,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34267 conditions, 15041 events. 8437/15041 cut-off events. For 3552/3552 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 116869 event pairs, 1188 based on Foata normal form. 0/6267 useless extension candidates. Maximal degree in co-relation 30302. Up to 11555 conditions per place. [2022-12-13 11:43:01,188 INFO L137 encePairwiseOnDemand]: 97/119 looper letters, 62 selfloop transitions, 12 changer transitions 59/159 dead transitions. [2022-12-13 11:43:01,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 159 transitions, 879 flow [2022-12-13 11:43:01,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:43:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:43:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-12-13 11:43:01,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-13 11:43:01,190 INFO L175 Difference]: Start difference. First operand has 131 places, 181 transitions, 856 flow. Second operand 3 states and 182 transitions. [2022-12-13 11:43:01,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 159 transitions, 879 flow [2022-12-13 11:43:01,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 159 transitions, 854 flow, removed 11 selfloop flow, removed 7 redundant places. [2022-12-13 11:43:01,243 INFO L231 Difference]: Finished difference. Result has 120 places, 80 transitions, 325 flow [2022-12-13 11:43:01,243 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=325, PETRI_PLACES=120, PETRI_TRANSITIONS=80} [2022-12-13 11:43:01,244 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 9 predicate places. [2022-12-13 11:43:01,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:01,244 INFO L89 Accepts]: Start accepts. Operand has 120 places, 80 transitions, 325 flow [2022-12-13 11:43:01,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:01,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:01,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 80 transitions, 325 flow [2022-12-13 11:43:01,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 80 transitions, 325 flow [2022-12-13 11:43:01,278 INFO L130 PetriNetUnfolder]: 59/422 cut-off events. [2022-12-13 11:43:01,278 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-13 11:43:01,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 422 events. 59/422 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2828 event pairs, 0 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 746. Up to 50 conditions per place. [2022-12-13 11:43:01,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 80 transitions, 325 flow [2022-12-13 11:43:01,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 1810 [2022-12-13 11:43:02,690 INFO L241 LiptonReduction]: Total number of compositions: 11 [2022-12-13 11:43:02,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1447 [2022-12-13 11:43:02,691 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 73 transitions, 367 flow [2022-12-13 11:43:02,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-13 11:43:02,691 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:02,691 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:02,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:43:02,691 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:43:02,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:02,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1381920925, now seen corresponding path program 1 times [2022-12-13 11:43:02,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:02,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789060098] [2022-12-13 11:43:02,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:02,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:03,096 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-13 11:43:03,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:03,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789060098] [2022-12-13 11:43:03,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789060098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:03,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:03,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:43:03,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937467761] [2022-12-13 11:43:03,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:03,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:43:03,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:03,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:43:03,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:43:03,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 67 [2022-12-13 11:43:03,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 73 transitions, 367 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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-13 11:43:03,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:03,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 67 [2022-12-13 11:43:03,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:04,218 INFO L130 PetriNetUnfolder]: 6658/11972 cut-off events. [2022-12-13 11:43:04,219 INFO L131 PetriNetUnfolder]: For 6671/6680 co-relation queries the response was YES. [2022-12-13 11:43:04,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31809 conditions, 11972 events. 6658/11972 cut-off events. For 6671/6680 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 89824 event pairs, 1620 based on Foata normal form. 46/6632 useless extension candidates. Maximal degree in co-relation 22064. Up to 4823 conditions per place. [2022-12-13 11:43:04,262 INFO L137 encePairwiseOnDemand]: 52/67 looper letters, 160 selfloop transitions, 14 changer transitions 29/215 dead transitions. [2022-12-13 11:43:04,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 215 transitions, 1422 flow [2022-12-13 11:43:04,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:43:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:43:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 273 transitions. [2022-12-13 11:43:04,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.582089552238806 [2022-12-13 11:43:04,264 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 367 flow. Second operand 7 states and 273 transitions. [2022-12-13 11:43:04,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 215 transitions, 1422 flow [2022-12-13 11:43:04,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 215 transitions, 1328 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 11:43:04,281 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 439 flow [2022-12-13 11:43:04,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=439, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2022-12-13 11:43:04,282 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -33 predicate places. [2022-12-13 11:43:04,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:04,282 INFO L89 Accepts]: Start accepts. Operand has 78 places, 78 transitions, 439 flow [2022-12-13 11:43:04,283 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:04,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:04,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 78 transitions, 439 flow [2022-12-13 11:43:04,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 78 transitions, 439 flow [2022-12-13 11:43:04,327 INFO L130 PetriNetUnfolder]: 148/771 cut-off events. [2022-12-13 11:43:04,328 INFO L131 PetriNetUnfolder]: For 1148/1152 co-relation queries the response was YES. [2022-12-13 11:43:04,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 771 events. 148/771 cut-off events. For 1148/1152 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6261 event pairs, 0 based on Foata normal form. 4/474 useless extension candidates. Maximal degree in co-relation 1281. Up to 150 conditions per place. [2022-12-13 11:43:04,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 78 transitions, 439 flow [2022-12-13 11:43:04,334 INFO L226 LiptonReduction]: Number of co-enabled transitions 1706 [2022-12-13 11:43:05,366 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 11:43:05,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1085 [2022-12-13 11:43:05,367 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 74 transitions, 441 flow [2022-12-13 11:43:05,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 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-13 11:43:05,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:05,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:05,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:43:05,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:43:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:05,368 INFO L85 PathProgramCache]: Analyzing trace with hash 60048697, now seen corresponding path program 1 times [2022-12-13 11:43:05,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:05,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657731194] [2022-12-13 11:43:05,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:05,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:05,720 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-13 11:43:05,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:05,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657731194] [2022-12-13 11:43:05,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657731194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:05,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:05,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:43:05,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133444969] [2022-12-13 11:43:05,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:05,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:43:05,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:05,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:43:05,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:43:05,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 63 [2022-12-13 11:43:05,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 74 transitions, 441 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-13 11:43:05,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:05,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 63 [2022-12-13 11:43:05,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:06,637 INFO L130 PetriNetUnfolder]: 7027/12731 cut-off events. [2022-12-13 11:43:06,638 INFO L131 PetriNetUnfolder]: For 14070/14070 co-relation queries the response was YES. [2022-12-13 11:43:06,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33284 conditions, 12731 events. 7027/12731 cut-off events. For 14070/14070 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 97747 event pairs, 1174 based on Foata normal form. 138/7503 useless extension candidates. Maximal degree in co-relation 25490. Up to 4272 conditions per place. [2022-12-13 11:43:06,681 INFO L137 encePairwiseOnDemand]: 49/63 looper letters, 130 selfloop transitions, 14 changer transitions 21/177 dead transitions. [2022-12-13 11:43:06,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 177 transitions, 1178 flow [2022-12-13 11:43:06,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:43:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:43:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 225 transitions. [2022-12-13 11:43:06,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-13 11:43:06,683 INFO L175 Difference]: Start difference. First operand has 69 places, 74 transitions, 441 flow. Second operand 6 states and 225 transitions. [2022-12-13 11:43:06,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 177 transitions, 1178 flow [2022-12-13 11:43:06,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 177 transitions, 1114 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-13 11:43:06,711 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 455 flow [2022-12-13 11:43:06,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2022-12-13 11:43:06,712 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -36 predicate places. [2022-12-13 11:43:06,712 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:06,712 INFO L89 Accepts]: Start accepts. Operand has 75 places, 75 transitions, 455 flow [2022-12-13 11:43:06,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:06,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:06,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 75 transitions, 455 flow [2022-12-13 11:43:06,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 75 transitions, 455 flow [2022-12-13 11:43:06,755 INFO L130 PetriNetUnfolder]: 148/859 cut-off events. [2022-12-13 11:43:06,756 INFO L131 PetriNetUnfolder]: For 1302/1313 co-relation queries the response was YES. [2022-12-13 11:43:06,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1873 conditions, 859 events. 148/859 cut-off events. For 1302/1313 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7583 event pairs, 3 based on Foata normal form. 5/481 useless extension candidates. Maximal degree in co-relation 1365. Up to 174 conditions per place. [2022-12-13 11:43:06,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 75 transitions, 455 flow [2022-12-13 11:43:06,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 1634 [2022-12-13 11:43:06,762 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:43:06,762 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 11:43:06,762 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 455 flow [2022-12-13 11:43:06,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-13 11:43:06,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:06,763 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:06,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:43:06,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:43:06,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:06,763 INFO L85 PathProgramCache]: Analyzing trace with hash 641784670, now seen corresponding path program 1 times [2022-12-13 11:43:06,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:06,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239898706] [2022-12-13 11:43:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:06,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:06,802 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-13 11:43:06,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:06,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239898706] [2022-12-13 11:43:06,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239898706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:43:06,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005465704] [2022-12-13 11:43:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:06,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:43:06,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:43:06,804 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-13 11:43:06,806 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-13 11:43:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:06,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 11:43:06,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:43:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:43:06,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:43:06,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005465704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:06,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:43:06,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-13 11:43:06,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449580649] [2022-12-13 11:43:06,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:06,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:43:06,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:06,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:43:06,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:43:06,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 60 [2022-12-13 11:43:06,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 455 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-13 11:43:06,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:06,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 60 [2022-12-13 11:43:06,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:07,647 INFO L130 PetriNetUnfolder]: 7383/13277 cut-off events. [2022-12-13 11:43:07,648 INFO L131 PetriNetUnfolder]: For 14382/14382 co-relation queries the response was YES. [2022-12-13 11:43:07,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34973 conditions, 13277 events. 7383/13277 cut-off events. For 14382/14382 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 103031 event pairs, 2623 based on Foata normal form. 123/7861 useless extension candidates. Maximal degree in co-relation 26553. Up to 4872 conditions per place. [2022-12-13 11:43:07,682 INFO L137 encePairwiseOnDemand]: 45/60 looper letters, 102 selfloop transitions, 13 changer transitions 4/128 dead transitions. [2022-12-13 11:43:07,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 128 transitions, 871 flow [2022-12-13 11:43:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:43:07,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:43:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-12-13 11:43:07,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-13 11:43:07,683 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 455 flow. Second operand 4 states and 141 transitions. [2022-12-13 11:43:07,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 128 transitions, 871 flow [2022-12-13 11:43:07,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 128 transitions, 855 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 11:43:07,711 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 486 flow [2022-12-13 11:43:07,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=486, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2022-12-13 11:43:07,712 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -32 predicate places. [2022-12-13 11:43:07,712 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:07,712 INFO L89 Accepts]: Start accepts. Operand has 79 places, 74 transitions, 486 flow [2022-12-13 11:43:07,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:07,713 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:07,713 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 486 flow [2022-12-13 11:43:07,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 74 transitions, 486 flow [2022-12-13 11:43:07,754 INFO L130 PetriNetUnfolder]: 129/880 cut-off events. [2022-12-13 11:43:07,754 INFO L131 PetriNetUnfolder]: For 1821/1831 co-relation queries the response was YES. [2022-12-13 11:43:07,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 880 events. 129/880 cut-off events. For 1821/1831 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8104 event pairs, 3 based on Foata normal form. 4/489 useless extension candidates. Maximal degree in co-relation 1575. Up to 174 conditions per place. [2022-12-13 11:43:07,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 74 transitions, 486 flow [2022-12-13 11:43:07,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 1578 [2022-12-13 11:43:07,761 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:43:07,762 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 11:43:07,762 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 486 flow [2022-12-13 11:43:07,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-13 11:43:07,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:07,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:07,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 11:43:07,967 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,SelfDestructingSolverStorable7 [2022-12-13 11:43:07,969 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:43:07,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:07,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1582603438, now seen corresponding path program 1 times [2022-12-13 11:43:07,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:07,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835091025] [2022-12-13 11:43:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:07,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:43:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:08,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835091025] [2022-12-13 11:43:08,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835091025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:08,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:08,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:43:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825794657] [2022-12-13 11:43:08,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:08,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:43:08,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:08,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:43:08,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:43:08,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 11:43:08,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:08,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:08,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 11:43:08,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:09,584 INFO L130 PetriNetUnfolder]: 10465/19171 cut-off events. [2022-12-13 11:43:09,584 INFO L131 PetriNetUnfolder]: For 25653/25653 co-relation queries the response was YES. [2022-12-13 11:43:09,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51540 conditions, 19171 events. 10465/19171 cut-off events. For 25653/25653 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 159002 event pairs, 3206 based on Foata normal form. 46/11215 useless extension candidates. Maximal degree in co-relation 42911. Up to 5131 conditions per place. [2022-12-13 11:43:09,649 INFO L137 encePairwiseOnDemand]: 42/58 looper letters, 179 selfloop transitions, 43 changer transitions 3/234 dead transitions. [2022-12-13 11:43:09,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 234 transitions, 1667 flow [2022-12-13 11:43:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:43:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 11:43:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 294 transitions. [2022-12-13 11:43:09,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.506896551724138 [2022-12-13 11:43:09,664 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 486 flow. Second operand 10 states and 294 transitions. [2022-12-13 11:43:09,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 234 transitions, 1667 flow [2022-12-13 11:43:09,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 234 transitions, 1636 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 11:43:09,718 INFO L231 Difference]: Finished difference. Result has 87 places, 101 transitions, 842 flow [2022-12-13 11:43:09,718 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=842, PETRI_PLACES=87, PETRI_TRANSITIONS=101} [2022-12-13 11:43:09,718 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -24 predicate places. [2022-12-13 11:43:09,718 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:09,718 INFO L89 Accepts]: Start accepts. Operand has 87 places, 101 transitions, 842 flow [2022-12-13 11:43:09,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:09,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:09,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 101 transitions, 842 flow [2022-12-13 11:43:09,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 101 transitions, 842 flow [2022-12-13 11:43:09,778 INFO L130 PetriNetUnfolder]: 187/1319 cut-off events. [2022-12-13 11:43:09,778 INFO L131 PetriNetUnfolder]: For 3036/3040 co-relation queries the response was YES. [2022-12-13 11:43:09,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3039 conditions, 1319 events. 187/1319 cut-off events. For 3036/3040 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13039 event pairs, 0 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 2537. Up to 254 conditions per place. [2022-12-13 11:43:09,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 101 transitions, 842 flow [2022-12-13 11:43:09,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 2084 [2022-12-13 11:43:09,787 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:43:09,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 11:43:09,788 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 101 transitions, 842 flow [2022-12-13 11:43:09,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:09,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:09,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:09,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:43:09,788 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:43:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:09,788 INFO L85 PathProgramCache]: Analyzing trace with hash -511069260, now seen corresponding path program 2 times [2022-12-13 11:43:09,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:09,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284701875] [2022-12-13 11:43:09,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:09,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:10,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:43:10,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:10,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284701875] [2022-12-13 11:43:10,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284701875] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:43:10,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599037924] [2022-12-13 11:43:10,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:43:10,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:43:10,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:43:10,157 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-13 11:43:10,187 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-13 11:43:10,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 11:43:10,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:43:10,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 11:43:10,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:43:10,287 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-13 11:43:10,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-13 11:43:10,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 11:43:10,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-13 11:43:10,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-13 11:43:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:43:17,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:43:17,230 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_294 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_294) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-13 11:43:17,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:43:17,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-13 11:43:17,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 57 [2022-12-13 11:43:17,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-13 11:43:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:43:17,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599037924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:43:17,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:43:17,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-13 11:43:17,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39874207] [2022-12-13 11:43:17,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:43:17,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 11:43:17,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:17,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 11:43:17,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=195, Unknown=1, NotChecked=28, Total=272 [2022-12-13 11:43:17,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 11:43:17,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 101 transitions, 842 flow. Second operand has 17 states, 17 states have (on average 11.294117647058824) internal successors, (192), 17 states have internal predecessors, (192), 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-13 11:43:17,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:17,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 11:43:17,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:18,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:21,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:23,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:25,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:27,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:29,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:31,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:33,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:35,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:37,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:39,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:41,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:43,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:45,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:48,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:50,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:52,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:54,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:56,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:43:58,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:01,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:03,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:05,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:07,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:11,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:13,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:15,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:17,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:19,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:21,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:23,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:26,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:28,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:30,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:32,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:34,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:36,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:38,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:40,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:42,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:44,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:46,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:48,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:50,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:52,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:55,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:56,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:44:58,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:01,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:03,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:07,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:09,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:11,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:13,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:15,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:17,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:20,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:22,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:24,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:26,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:28,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:30,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:32,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:34,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:36,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:38,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:40,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:42,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:44,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:46,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:48,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:50,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:52,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:54,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:56,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:45:58,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:46:01,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:46:03,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:46:05,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:46:07,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:46:09,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:46:12,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:46:15,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:46:15,141 INFO L130 PetriNetUnfolder]: 21727/39898 cut-off events. [2022-12-13 11:46:15,142 INFO L131 PetriNetUnfolder]: For 67205/67205 co-relation queries the response was YES. [2022-12-13 11:46:15,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110043 conditions, 39898 events. 21727/39898 cut-off events. For 67205/67205 co-relation queries the response was YES. Maximal size of possible extension queue 1345. Compared 357834 event pairs, 4324 based on Foata normal form. 23/23461 useless extension candidates. Maximal degree in co-relation 82062. Up to 7935 conditions per place. [2022-12-13 11:46:15,430 INFO L137 encePairwiseOnDemand]: 40/58 looper letters, 245 selfloop transitions, 105 changer transitions 5/364 dead transitions. [2022-12-13 11:46:15,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 364 transitions, 3065 flow [2022-12-13 11:46:15,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:46:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 11:46:15,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 414 transitions. [2022-12-13 11:46:15,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5098522167487685 [2022-12-13 11:46:15,432 INFO L175 Difference]: Start difference. First operand has 87 places, 101 transitions, 842 flow. Second operand 14 states and 414 transitions. [2022-12-13 11:46:15,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 364 transitions, 3065 flow [2022-12-13 11:46:15,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 364 transitions, 2951 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-13 11:46:15,619 INFO L231 Difference]: Finished difference. Result has 100 places, 168 transitions, 1885 flow [2022-12-13 11:46:15,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1885, PETRI_PLACES=100, PETRI_TRANSITIONS=168} [2022-12-13 11:46:15,621 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -11 predicate places. [2022-12-13 11:46:15,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:15,621 INFO L89 Accepts]: Start accepts. Operand has 100 places, 168 transitions, 1885 flow [2022-12-13 11:46:15,624 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:15,624 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:15,624 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 168 transitions, 1885 flow [2022-12-13 11:46:15,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 168 transitions, 1885 flow [2022-12-13 11:46:15,836 INFO L130 PetriNetUnfolder]: 374/2620 cut-off events. [2022-12-13 11:46:15,837 INFO L131 PetriNetUnfolder]: For 8354/8360 co-relation queries the response was YES. [2022-12-13 11:46:15,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6435 conditions, 2620 events. 374/2620 cut-off events. For 8354/8360 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 28535 event pairs, 0 based on Foata normal form. 2/1501 useless extension candidates. Maximal degree in co-relation 4937. Up to 506 conditions per place. [2022-12-13 11:46:15,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 168 transitions, 1885 flow [2022-12-13 11:46:15,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 3432 [2022-12-13 11:46:15,866 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:15,866 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-13 11:46:15,867 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 168 transitions, 1885 flow [2022-12-13 11:46:15,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.294117647058824) internal successors, (192), 17 states have internal predecessors, (192), 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-13 11:46:15,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:15,867 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:15,874 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-13 11:46:16,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:46:16,069 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:16,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash -971263192, now seen corresponding path program 1 times [2022-12-13 11:46:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:16,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569540669] [2022-12-13 11:46:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:16,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:16,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569540669] [2022-12-13 11:46:16,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569540669] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:46:16,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604199730] [2022-12-13 11:46:16,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:16,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:46:16,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:46:16,153 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-13 11:46:16,155 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-13 11:46:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:16,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:46:16,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:46:16,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:16,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:46:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:16,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604199730] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:46:16,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:46:16,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-13 11:46:16,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847615632] [2022-12-13 11:46:16,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:46:16,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 11:46:16,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:16,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 11:46:16,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:46:16,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 58 [2022-12-13 11:46:16,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 168 transitions, 1885 flow. Second operand has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 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-13 11:46:16,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:16,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 58 [2022-12-13 11:46:16,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:21,373 INFO L130 PetriNetUnfolder]: 30816/55937 cut-off events. [2022-12-13 11:46:21,374 INFO L131 PetriNetUnfolder]: For 115664/115664 co-relation queries the response was YES. [2022-12-13 11:46:21,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159340 conditions, 55937 events. 30816/55937 cut-off events. For 115664/115664 co-relation queries the response was YES. Maximal size of possible extension queue 1511. Compared 493973 event pairs, 5612 based on Foata normal form. 567/33453 useless extension candidates. Maximal degree in co-relation 127297. Up to 11174 conditions per place. [2022-12-13 11:46:21,723 INFO L137 encePairwiseOnDemand]: 40/58 looper letters, 357 selfloop transitions, 137 changer transitions 16/519 dead transitions. [2022-12-13 11:46:21,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 519 transitions, 4863 flow [2022-12-13 11:46:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:46:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 11:46:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 507 transitions. [2022-12-13 11:46:21,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48563218390804597 [2022-12-13 11:46:21,725 INFO L175 Difference]: Start difference. First operand has 100 places, 168 transitions, 1885 flow. Second operand 18 states and 507 transitions. [2022-12-13 11:46:21,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 519 transitions, 4863 flow [2022-12-13 11:46:22,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 519 transitions, 4603 flow, removed 128 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:22,062 INFO L231 Difference]: Finished difference. Result has 123 places, 230 transitions, 3120 flow [2022-12-13 11:46:22,063 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3120, PETRI_PLACES=123, PETRI_TRANSITIONS=230} [2022-12-13 11:46:22,063 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 12 predicate places. [2022-12-13 11:46:22,063 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:22,063 INFO L89 Accepts]: Start accepts. Operand has 123 places, 230 transitions, 3120 flow [2022-12-13 11:46:22,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:22,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:22,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 230 transitions, 3120 flow [2022-12-13 11:46:22,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 230 transitions, 3120 flow [2022-12-13 11:46:22,299 INFO L130 PetriNetUnfolder]: 544/3535 cut-off events. [2022-12-13 11:46:22,300 INFO L131 PetriNetUnfolder]: For 16121/16132 co-relation queries the response was YES. [2022-12-13 11:46:22,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10093 conditions, 3535 events. 544/3535 cut-off events. For 16121/16132 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 38122 event pairs, 0 based on Foata normal form. 2/2112 useless extension candidates. Maximal degree in co-relation 9855. Up to 718 conditions per place. [2022-12-13 11:46:22,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 230 transitions, 3120 flow [2022-12-13 11:46:22,339 INFO L226 LiptonReduction]: Number of co-enabled transitions 4744 [2022-12-13 11:46:22,642 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 11:46:22,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 579 [2022-12-13 11:46:22,642 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 228 transitions, 3120 flow [2022-12-13 11:46:22,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.23076923076923) internal successors, (146), 13 states have internal predecessors, (146), 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-13 11:46:22,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:22,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:22,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 11:46:22,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:46:22,848 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1481343952, now seen corresponding path program 1 times [2022-12-13 11:46:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:22,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724683794] [2022-12-13 11:46:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:22,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:23,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:23,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724683794] [2022-12-13 11:46:23,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724683794] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:46:23,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249492879] [2022-12-13 11:46:23,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:23,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:46:23,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:46:23,761 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-13 11:46:23,762 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-13 11:46:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:23,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 11:46:23,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:46:23,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-12-13 11:46:24,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:46:24,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2022-12-13 11:46:24,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-13 11:46:26,181 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_9_48 Int) (aux_mod_v_arrayElimCell_9_48 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_9_48 4294967296))) (and (<= (+ .cse0 aux_mod_v_arrayElimCell_9_48 1) 0) (<= 4294966496 aux_mod_v_arrayElimCell_9_48) (< aux_mod_v_arrayElimCell_9_48 4294967296) (< 0 (+ .cse0 4294967297 aux_mod_v_arrayElimCell_9_48)) (= (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_9_48) 4294967295) 4294967296) |c_t2Thread1of1ForFork0_pop_#res#1|)))) is different from true [2022-12-13 11:46:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 11:46:26,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:46:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:26,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249492879] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:46:26,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:46:26,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 15 [2022-12-13 11:46:26,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025723942] [2022-12-13 11:46:26,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:46:26,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:46:26,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:26,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:46:26,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=158, Unknown=1, NotChecked=26, Total=240 [2022-12-13 11:46:26,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 72 [2022-12-13 11:46:26,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 228 transitions, 3120 flow. Second operand has 16 states, 16 states have (on average 12.0) internal successors, (192), 16 states have internal predecessors, (192), 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-13 11:46:26,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:26,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 72 [2022-12-13 11:46:26,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:42,313 INFO L130 PetriNetUnfolder]: 45292/82613 cut-off events. [2022-12-13 11:46:42,313 INFO L131 PetriNetUnfolder]: For 195587/195587 co-relation queries the response was YES. [2022-12-13 11:46:42,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243846 conditions, 82613 events. 45292/82613 cut-off events. For 195587/195587 co-relation queries the response was YES. Maximal size of possible extension queue 2404. Compared 784601 event pairs, 15532 based on Foata normal form. 107/48727 useless extension candidates. Maximal degree in co-relation 233889. Up to 36713 conditions per place. [2022-12-13 11:46:42,921 INFO L137 encePairwiseOnDemand]: 42/72 looper letters, 483 selfloop transitions, 144 changer transitions 49/685 dead transitions. [2022-12-13 11:46:42,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 685 transitions, 7831 flow [2022-12-13 11:46:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 11:46:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-13 11:46:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 616 transitions. [2022-12-13 11:46:42,923 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2022-12-13 11:46:42,924 INFO L175 Difference]: Start difference. First operand has 121 places, 228 transitions, 3120 flow. Second operand 21 states and 616 transitions. [2022-12-13 11:46:42,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 685 transitions, 7831 flow [2022-12-13 11:46:44,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 685 transitions, 7385 flow, removed 223 selfloop flow, removed 0 redundant places. [2022-12-13 11:46:44,025 INFO L231 Difference]: Finished difference. Result has 155 places, 313 transitions, 4552 flow [2022-12-13 11:46:44,026 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=72, PETRI_DIFFERENCE_MINUEND_FLOW=2836, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4552, PETRI_PLACES=155, PETRI_TRANSITIONS=313} [2022-12-13 11:46:44,026 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 44 predicate places. [2022-12-13 11:46:44,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:44,026 INFO L89 Accepts]: Start accepts. Operand has 155 places, 313 transitions, 4552 flow [2022-12-13 11:46:44,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:44,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:44,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 313 transitions, 4552 flow [2022-12-13 11:46:44,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 313 transitions, 4552 flow [2022-12-13 11:46:45,047 INFO L130 PetriNetUnfolder]: 2578/11622 cut-off events. [2022-12-13 11:46:45,047 INFO L131 PetriNetUnfolder]: For 59892/62054 co-relation queries the response was YES. [2022-12-13 11:46:45,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36674 conditions, 11622 events. 2578/11622 cut-off events. For 59892/62054 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 146048 event pairs, 651 based on Foata normal form. 27/6706 useless extension candidates. Maximal degree in co-relation 34730. Up to 2189 conditions per place. [2022-12-13 11:46:45,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 313 transitions, 4552 flow [2022-12-13 11:46:45,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 6118 [2022-12-13 11:46:45,298 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L1005-6-->pop_returnLabel#1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_499| |v_~#m~0.base_233|))) (and (< 0 v_~top~0_715) (= (select .cse0 |v_~#m~0.offset_233|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132| |v_~#arr~0.offset_138|) (< |v_t2Thread1of1ForFork0_~i~1#1_132| 800) (= (+ v_~top~0_714 1) v_~top~0_715) (= (store |v_#pthreadsMutex_499| |v_~#m~0.base_233| (store .cse0 |v_~#m~0.offset_233| 1)) |v_#pthreadsMutex_498|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| v_~top~0_714) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (= |v_~#arr~0.base_143| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (<= |v_t2Thread1of1ForFork0_get_top_#res#1_93| 2147483647) (= (let ((.cse1 (mod (select (select |v_#memory_int_246| |v_t2Thread1of1ForFork0_pop_~stack#1.base_194|) (+ |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| (* |v_t2Thread1of1ForFork0_get_top_#res#1_93| 4))) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |v_t2Thread1of1ForFork0_pop_#res#1_161|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_499|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, ~top~0=v_~top~0_715, ~#arr~0.base=|v_~#arr~0.base_143|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_498|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_125|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_93|, t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_265|, t2Thread1of1ForFork0_#t~nondet43#1=|v_t2Thread1of1ForFork0_#t~nondet43#1_104|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_161|, ~top~0=v_~top~0_714, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_194|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_171|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_194|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_109|, ~#arr~0.base=|v_~#arr~0.base_143|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, t2Thread1of1ForFork0_#t~nondet43#1, t2Thread1of1ForFork0_pop_#res#1, ~top~0, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [506] L1022-4-->L1023: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_3|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-13 11:46:45,377 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L1005-6-->pop_returnLabel#1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_499| |v_~#m~0.base_233|))) (and (< 0 v_~top~0_715) (= (select .cse0 |v_~#m~0.offset_233|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132| |v_~#arr~0.offset_138|) (< |v_t2Thread1of1ForFork0_~i~1#1_132| 800) (= (+ v_~top~0_714 1) v_~top~0_715) (= (store |v_#pthreadsMutex_499| |v_~#m~0.base_233| (store .cse0 |v_~#m~0.offset_233| 1)) |v_#pthreadsMutex_498|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| v_~top~0_714) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (= |v_~#arr~0.base_143| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (<= |v_t2Thread1of1ForFork0_get_top_#res#1_93| 2147483647) (= (let ((.cse1 (mod (select (select |v_#memory_int_246| |v_t2Thread1of1ForFork0_pop_~stack#1.base_194|) (+ |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| (* |v_t2Thread1of1ForFork0_get_top_#res#1_93| 4))) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |v_t2Thread1of1ForFork0_pop_#res#1_161|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_499|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, ~top~0=v_~top~0_715, ~#arr~0.base=|v_~#arr~0.base_143|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_498|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_125|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_93|, t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_265|, t2Thread1of1ForFork0_#t~nondet43#1=|v_t2Thread1of1ForFork0_#t~nondet43#1_104|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_161|, ~top~0=v_~top~0_714, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_194|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_171|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_194|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_109|, ~#arr~0.base=|v_~#arr~0.base_143|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, t2Thread1of1ForFork0_#t~nondet43#1, t2Thread1of1ForFork0_pop_#res#1, ~top~0, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [637] L1022-4-->L1023-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_16| (select (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#id1~0#1.base_17|) |v_ULTIMATE.start_main_~#id1~0#1.offset_17|)) InVars {#memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_16|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_13|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_25|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-13 11:46:45,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L1005-6-->pop_returnLabel#1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_499| |v_~#m~0.base_233|))) (and (< 0 v_~top~0_715) (= (select .cse0 |v_~#m~0.offset_233|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132| |v_~#arr~0.offset_138|) (< |v_t2Thread1of1ForFork0_~i~1#1_132| 800) (= (+ v_~top~0_714 1) v_~top~0_715) (= (store |v_#pthreadsMutex_499| |v_~#m~0.base_233| (store .cse0 |v_~#m~0.offset_233| 1)) |v_#pthreadsMutex_498|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| v_~top~0_714) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (= |v_~#arr~0.base_143| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (<= |v_t2Thread1of1ForFork0_get_top_#res#1_93| 2147483647) (= (let ((.cse1 (mod (select (select |v_#memory_int_246| |v_t2Thread1of1ForFork0_pop_~stack#1.base_194|) (+ |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| (* |v_t2Thread1of1ForFork0_get_top_#res#1_93| 4))) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |v_t2Thread1of1ForFork0_pop_#res#1_161|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_499|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, ~top~0=v_~top~0_715, ~#arr~0.base=|v_~#arr~0.base_143|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_498|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_125|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_93|, t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_265|, t2Thread1of1ForFork0_#t~nondet43#1=|v_t2Thread1of1ForFork0_#t~nondet43#1_104|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_161|, ~top~0=v_~top~0_714, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_194|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_171|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_194|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_109|, ~#arr~0.base=|v_~#arr~0.base_143|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, t2Thread1of1ForFork0_#t~nondet43#1, t2Thread1of1ForFork0_pop_#res#1, ~top~0, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [660] L991-6-->t1EXIT: Formula: (and (= |v_t1Thread1of1ForFork1_#res#1.base_9| 0) (= |v_t1Thread1of1ForFork1_#res#1.offset_9| 0) (not (< |v_t1Thread1of1ForFork1_~i~0#1_83| 800))) InVars {t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_83|} OutVars{t1Thread1of1ForFork1_#res#1.offset=|v_t1Thread1of1ForFork1_#res#1.offset_9|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_83|, t1Thread1of1ForFork1_#res#1.base=|v_t1Thread1of1ForFork1_#res#1.base_9|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#res#1.offset, t1Thread1of1ForFork1_#res#1.base] [2022-12-13 11:46:45,833 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L1005-6-->pop_returnLabel#1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_499| |v_~#m~0.base_233|))) (and (< 0 v_~top~0_715) (= (select .cse0 |v_~#m~0.offset_233|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132| |v_~#arr~0.offset_138|) (< |v_t2Thread1of1ForFork0_~i~1#1_132| 800) (= (+ v_~top~0_714 1) v_~top~0_715) (= (store |v_#pthreadsMutex_499| |v_~#m~0.base_233| (store .cse0 |v_~#m~0.offset_233| 1)) |v_#pthreadsMutex_498|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| v_~top~0_714) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (= |v_~#arr~0.base_143| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (<= |v_t2Thread1of1ForFork0_get_top_#res#1_93| 2147483647) (= (let ((.cse1 (mod (select (select |v_#memory_int_246| |v_t2Thread1of1ForFork0_pop_~stack#1.base_194|) (+ |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| (* |v_t2Thread1of1ForFork0_get_top_#res#1_93| 4))) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |v_t2Thread1of1ForFork0_pop_#res#1_161|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_499|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, ~top~0=v_~top~0_715, ~#arr~0.base=|v_~#arr~0.base_143|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_498|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_125|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_93|, t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_265|, t2Thread1of1ForFork0_#t~nondet43#1=|v_t2Thread1of1ForFork0_#t~nondet43#1_104|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_161|, ~top~0=v_~top~0_714, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_194|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_171|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_194|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_109|, ~#arr~0.base=|v_~#arr~0.base_143|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, t2Thread1of1ForFork0_#t~nondet43#1, t2Thread1of1ForFork0_pop_#res#1, ~top~0, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [637] L1022-4-->L1023-1: Formula: (= |v_ULTIMATE.start_main_#t~mem49#1_16| (select (select |v_#memory_int_131| |v_ULTIMATE.start_main_~#id1~0#1.base_17|) |v_ULTIMATE.start_main_~#id1~0#1.offset_17|)) InVars {#memory_int=|v_#memory_int_131|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} OutVars{ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_16|, ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_13|, #memory_int=|v_#memory_int_131|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_25|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_17|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-13 11:46:46,095 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L1005-6-->pop_returnLabel#1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_499| |v_~#m~0.base_233|))) (and (< 0 v_~top~0_715) (= (select .cse0 |v_~#m~0.offset_233|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132| |v_~#arr~0.offset_138|) (< |v_t2Thread1of1ForFork0_~i~1#1_132| 800) (= (+ v_~top~0_714 1) v_~top~0_715) (= (store |v_#pthreadsMutex_499| |v_~#m~0.base_233| (store .cse0 |v_~#m~0.offset_233| 1)) |v_#pthreadsMutex_498|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| v_~top~0_714) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (= |v_~#arr~0.base_143| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (<= |v_t2Thread1of1ForFork0_get_top_#res#1_93| 2147483647) (= (let ((.cse1 (mod (select (select |v_#memory_int_246| |v_t2Thread1of1ForFork0_pop_~stack#1.base_194|) (+ |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| (* |v_t2Thread1of1ForFork0_get_top_#res#1_93| 4))) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |v_t2Thread1of1ForFork0_pop_#res#1_161|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_499|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, ~top~0=v_~top~0_715, ~#arr~0.base=|v_~#arr~0.base_143|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_498|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_125|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_93|, t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_265|, t2Thread1of1ForFork0_#t~nondet43#1=|v_t2Thread1of1ForFork0_#t~nondet43#1_104|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_161|, ~top~0=v_~top~0_714, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_194|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_171|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_194|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_109|, ~#arr~0.base=|v_~#arr~0.base_143|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, t2Thread1of1ForFork0_#t~nondet43#1, t2Thread1of1ForFork0_pop_#res#1, ~top~0, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [627] L1023-2-->L1024-1: Formula: (= (select (select |v_#memory_int_129| |v_ULTIMATE.start_main_~#id2~0#1.base_23|) |v_ULTIMATE.start_main_~#id2~0#1.offset_23|) |v_ULTIMATE.start_main_#t~mem50#1_14|) InVars {ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, #memory_int=|v_#memory_int_129|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|} OutVars{ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_23|, ULTIMATE.start_main_#t~mem49#1=|v_ULTIMATE.start_main_#t~mem49#1_14|, #memory_int=|v_#memory_int_129|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_23|, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem49#1, ULTIMATE.start_main_#t~mem50#1] [2022-12-13 11:46:46,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L1005-6-->pop_returnLabel#1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_499| |v_~#m~0.base_233|))) (and (< 0 v_~top~0_715) (= (select .cse0 |v_~#m~0.offset_233|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132| |v_~#arr~0.offset_138|) (< |v_t2Thread1of1ForFork0_~i~1#1_132| 800) (= (+ v_~top~0_714 1) v_~top~0_715) (= (store |v_#pthreadsMutex_499| |v_~#m~0.base_233| (store .cse0 |v_~#m~0.offset_233| 1)) |v_#pthreadsMutex_498|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| v_~top~0_714) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (= |v_~#arr~0.base_143| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (<= |v_t2Thread1of1ForFork0_get_top_#res#1_93| 2147483647) (= (let ((.cse1 (mod (select (select |v_#memory_int_246| |v_t2Thread1of1ForFork0_pop_~stack#1.base_194|) (+ |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| (* |v_t2Thread1of1ForFork0_get_top_#res#1_93| 4))) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |v_t2Thread1of1ForFork0_pop_#res#1_161|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_499|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, ~top~0=v_~top~0_715, ~#arr~0.base=|v_~#arr~0.base_143|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_498|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_125|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_93|, t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_265|, t2Thread1of1ForFork0_#t~nondet43#1=|v_t2Thread1of1ForFork0_#t~nondet43#1_104|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_161|, ~top~0=v_~top~0_714, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_194|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_171|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_194|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_109|, ~#arr~0.base=|v_~#arr~0.base_143|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, t2Thread1of1ForFork0_#t~nondet43#1, t2Thread1of1ForFork0_pop_#res#1, ~top~0, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [647] L991-6-->L991-7: Formula: (not (< |v_t1Thread1of1ForFork1_~i~0#1_In_1| 800)) InVars {t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_In_1|} OutVars{t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_In_1|} AuxVars[] AssignedVars[] [2022-12-13 11:46:46,291 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L1005-6-->pop_returnLabel#1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_499| |v_~#m~0.base_233|))) (and (< 0 v_~top~0_715) (= (select .cse0 |v_~#m~0.offset_233|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132| |v_~#arr~0.offset_138|) (< |v_t2Thread1of1ForFork0_~i~1#1_132| 800) (= (+ v_~top~0_714 1) v_~top~0_715) (= (store |v_#pthreadsMutex_499| |v_~#m~0.base_233| (store .cse0 |v_~#m~0.offset_233| 1)) |v_#pthreadsMutex_498|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| v_~top~0_714) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (= |v_~#arr~0.base_143| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (<= |v_t2Thread1of1ForFork0_get_top_#res#1_93| 2147483647) (= (let ((.cse1 (mod (select (select |v_#memory_int_246| |v_t2Thread1of1ForFork0_pop_~stack#1.base_194|) (+ |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| (* |v_t2Thread1of1ForFork0_get_top_#res#1_93| 4))) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |v_t2Thread1of1ForFork0_pop_#res#1_161|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_499|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, ~top~0=v_~top~0_715, ~#arr~0.base=|v_~#arr~0.base_143|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_498|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_125|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_93|, t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_265|, t2Thread1of1ForFork0_#t~nondet43#1=|v_t2Thread1of1ForFork0_#t~nondet43#1_104|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_161|, ~top~0=v_~top~0_714, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_194|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_171|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_194|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_109|, ~#arr~0.base=|v_~#arr~0.base_143|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, t2Thread1of1ForFork0_#t~nondet43#1, t2Thread1of1ForFork0_pop_#res#1, ~top~0, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [659] L991-6-->t1FINAL: Formula: (and (= |v_t1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_t1Thread1of1ForFork1_#res#1.base_7| 0) (not (< |v_t1Thread1of1ForFork1_~i~0#1_81| 800))) InVars {t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_81|} OutVars{t1Thread1of1ForFork1_#res#1.offset=|v_t1Thread1of1ForFork1_#res#1.offset_7|, t1Thread1of1ForFork1_~i~0#1=|v_t1Thread1of1ForFork1_~i~0#1_81|, t1Thread1of1ForFork1_#res#1.base=|v_t1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_#res#1.offset, t1Thread1of1ForFork1_#res#1.base] [2022-12-13 11:46:46,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] L1005-6-->pop_returnLabel#1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_499| |v_~#m~0.base_233|))) (and (< 0 v_~top~0_715) (= (select .cse0 |v_~#m~0.offset_233|) 0) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132| |v_~#arr~0.offset_138|) (< |v_t2Thread1of1ForFork0_~i~1#1_132| 800) (= (+ v_~top~0_714 1) v_~top~0_715) (= (store |v_#pthreadsMutex_499| |v_~#m~0.base_233| (store .cse0 |v_~#m~0.offset_233| 1)) |v_#pthreadsMutex_498|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_93| v_~top~0_714) (= |v_t2Thread1of1ForFork0_pop_~stack#1.base_194| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (= |v_~#arr~0.base_143| |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|) (<= |v_t2Thread1of1ForFork0_get_top_#res#1_93| 2147483647) (= (let ((.cse1 (mod (select (select |v_#memory_int_246| |v_t2Thread1of1ForFork0_pop_~stack#1.base_194|) (+ |v_t2Thread1of1ForFork0_pop_~stack#1.offset_194| (* |v_t2Thread1of1ForFork0_get_top_#res#1_93| 4))) 4294967296))) (ite (<= .cse1 2147483647) .cse1 (+ .cse1 (- 4294967296)))) |v_t2Thread1of1ForFork0_pop_#res#1_161|))) InVars {~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_499|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, ~top~0=v_~top~0_715, ~#arr~0.base=|v_~#arr~0.base_143|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_138|, #pthreadsMutex=|v_#pthreadsMutex_498|, t2Thread1of1ForFork0_pop_#t~mem37#1=|v_t2Thread1of1ForFork0_pop_#t~mem37#1_125|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_93|, t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_265|, t2Thread1of1ForFork0_#t~nondet43#1=|v_t2Thread1of1ForFork0_#t~nondet43#1_104|, t2Thread1of1ForFork0_~i~1#1=|v_t2Thread1of1ForFork0_~i~1#1_132|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_161|, ~top~0=v_~top~0_714, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_194|, t2Thread1of1ForFork0_pop_#t~ret36#1=|v_t2Thread1of1ForFork0_pop_#t~ret36#1_171|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_194|, ~#m~0.base=|v_~#m~0.base_233|, ~#m~0.offset=|v_~#m~0.offset_233|, #memory_int=|v_#memory_int_246|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_132|, t2Thread1of1ForFork0_pop_#t~nondet35#1=|v_t2Thread1of1ForFork0_pop_#t~nondet35#1_109|, ~#arr~0.base=|v_~#arr~0.base_143|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_132|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_pop_#t~mem37#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_dec_top_#t~post32#1, t2Thread1of1ForFork0_#t~nondet43#1, t2Thread1of1ForFork0_pop_#res#1, ~top~0, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret36#1, t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~nondet35#1, t2Thread1of1ForFork0_pop_#in~stack#1.base] and [506] L1022-4-->L1023: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet48#1=|v_ULTIMATE.start_main_#t~nondet48#1_3|, ULTIMATE.start_main_#t~pre47#1=|v_ULTIMATE.start_main_#t~pre47#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~pre47#1] [2022-12-13 11:46:47,019 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 11:46:47,020 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2994 [2022-12-13 11:46:47,020 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 309 transitions, 4686 flow [2022-12-13 11:46:47,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.0) internal successors, (192), 16 states have internal predecessors, (192), 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-13 11:46:47,020 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:47,020 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:47,026 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-13 11:46:47,221 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,SelfDestructingSolverStorable11 [2022-12-13 11:46:47,221 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:46:47,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:47,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1521206232, now seen corresponding path program 1 times [2022-12-13 11:46:47,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:47,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130205421] [2022-12-13 11:46:47,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:47,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 11:46:47,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130205421] [2022-12-13 11:46:47,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130205421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:47,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:47,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:46:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997315387] [2022-12-13 11:46:47,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:47,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:46:47,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:47,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:46:47,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:46:47,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 90 [2022-12-13 11:46:47,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 309 transitions, 4686 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-13 11:46:47,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:47,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 90 [2022-12-13 11:46:47,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:02,007 INFO L130 PetriNetUnfolder]: 63490/116317 cut-off events. [2022-12-13 11:47:02,007 INFO L131 PetriNetUnfolder]: For 343570/343570 co-relation queries the response was YES. [2022-12-13 11:47:03,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432410 conditions, 116317 events. 63490/116317 cut-off events. For 343570/343570 co-relation queries the response was YES. Maximal size of possible extension queue 2829. Compared 1169265 event pairs, 38441 based on Foata normal form. 46/68410 useless extension candidates. Maximal degree in co-relation 415617. Up to 61297 conditions per place. [2022-12-13 11:47:03,313 INFO L137 encePairwiseOnDemand]: 58/90 looper letters, 408 selfloop transitions, 123 changer transitions 1/541 dead transitions. [2022-12-13 11:47:03,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 541 transitions, 8410 flow [2022-12-13 11:47:03,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:47:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 11:47:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 295 transitions. [2022-12-13 11:47:03,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36419753086419754 [2022-12-13 11:47:03,314 INFO L175 Difference]: Start difference. First operand has 151 places, 309 transitions, 4686 flow. Second operand 9 states and 295 transitions. [2022-12-13 11:47:03,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 541 transitions, 8410 flow [2022-12-13 11:47:05,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 541 transitions, 8262 flow, removed 72 selfloop flow, removed 3 redundant places. [2022-12-13 11:47:05,751 INFO L231 Difference]: Finished difference. Result has 159 places, 382 transitions, 6327 flow [2022-12-13 11:47:05,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=4584, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6327, PETRI_PLACES=159, PETRI_TRANSITIONS=382} [2022-12-13 11:47:05,751 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 48 predicate places. [2022-12-13 11:47:05,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:05,752 INFO L89 Accepts]: Start accepts. Operand has 159 places, 382 transitions, 6327 flow [2022-12-13 11:47:05,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:05,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:05,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 382 transitions, 6327 flow [2022-12-13 11:47:05,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 382 transitions, 6327 flow [2022-12-13 11:47:06,677 INFO L130 PetriNetUnfolder]: 2163/9343 cut-off events. [2022-12-13 11:47:06,677 INFO L131 PetriNetUnfolder]: For 49662/51911 co-relation queries the response was YES. [2022-12-13 11:47:06,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30917 conditions, 9343 events. 2163/9343 cut-off events. For 49662/51911 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 113955 event pairs, 958 based on Foata normal form. 35/5141 useless extension candidates. Maximal degree in co-relation 29670. Up to 2549 conditions per place. [2022-12-13 11:47:06,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 382 transitions, 6327 flow [2022-12-13 11:47:06,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 7336 [2022-12-13 11:47:06,909 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:47:06,909 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1157 [2022-12-13 11:47:06,909 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 379 transitions, 6318 flow [2022-12-13 11:47:06,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-13 11:47:06,910 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:06,910 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:06,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:47:06,910 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:06,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash -357159040, now seen corresponding path program 1 times [2022-12-13 11:47:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:06,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385073653] [2022-12-13 11:47:06,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:06,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:07,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:07,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385073653] [2022-12-13 11:47:07,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385073653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:47:07,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470585367] [2022-12-13 11:47:07,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:07,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:47:07,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:47:07,465 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-13 11:47:07,495 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-13 11:47:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:07,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 11:47:07,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:47:07,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 11:47:07,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-13 11:47:09,711 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_10_49 Int) (aux_mod_v_arrayElimCell_10_49 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_10_49 4294967296))) (and (<= (+ .cse0 aux_mod_v_arrayElimCell_10_49 1) 0) (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_10_49)) 4294967296) |c_t2Thread1of1ForFork0_pop_#res#1|) (< aux_mod_v_arrayElimCell_10_49 4294967296) (< 0 (+ .cse0 aux_mod_v_arrayElimCell_10_49 4294967297)) (<= 4294966496 aux_mod_v_arrayElimCell_10_49)))) is different from true [2022-12-13 11:47:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-12-13 11:47:09,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:47:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:47:09,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470585367] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 11:47:09,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 11:47:09,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 13 [2022-12-13 11:47:09,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351389671] [2022-12-13 11:47:09,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:09,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:47:09,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:09,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:47:09,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=115, Unknown=1, NotChecked=22, Total=182 [2022-12-13 11:47:09,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 94 [2022-12-13 11:47:09,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 379 transitions, 6318 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-13 11:47:09,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:09,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 94 [2022-12-13 11:47:09,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:25,900 INFO L130 PetriNetUnfolder]: 68618/126926 cut-off events. [2022-12-13 11:47:25,900 INFO L131 PetriNetUnfolder]: For 409845/409845 co-relation queries the response was YES. [2022-12-13 11:47:27,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473974 conditions, 126926 events. 68618/126926 cut-off events. For 409845/409845 co-relation queries the response was YES. Maximal size of possible extension queue 3238. Compared 1286927 event pairs, 13855 based on Foata normal form. 69/74873 useless extension candidates. Maximal degree in co-relation 457009. Up to 48018 conditions per place. [2022-12-13 11:47:27,368 INFO L137 encePairwiseOnDemand]: 47/94 looper letters, 215 selfloop transitions, 325 changer transitions 3/552 dead transitions. [2022-12-13 11:47:27,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 552 transitions, 8648 flow [2022-12-13 11:47:27,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:47:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 11:47:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 327 transitions. [2022-12-13 11:47:27,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38652482269503546 [2022-12-13 11:47:27,369 INFO L175 Difference]: Start difference. First operand has 156 places, 379 transitions, 6318 flow. Second operand 9 states and 327 transitions. [2022-12-13 11:47:27,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 552 transitions, 8648 flow [2022-12-13 11:47:29,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 552 transitions, 8602 flow, removed 19 selfloop flow, removed 3 redundant places. [2022-12-13 11:47:29,899 INFO L231 Difference]: Finished difference. Result has 165 places, 416 transitions, 7826 flow [2022-12-13 11:47:29,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=6276, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=289, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7826, PETRI_PLACES=165, PETRI_TRANSITIONS=416} [2022-12-13 11:47:29,899 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 54 predicate places. [2022-12-13 11:47:29,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:29,900 INFO L89 Accepts]: Start accepts. Operand has 165 places, 416 transitions, 7826 flow [2022-12-13 11:47:29,901 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:29,901 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:29,901 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 416 transitions, 7826 flow [2022-12-13 11:47:29,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 416 transitions, 7826 flow [2022-12-13 11:47:31,790 INFO L130 PetriNetUnfolder]: 3578/17323 cut-off events. [2022-12-13 11:47:31,791 INFO L131 PetriNetUnfolder]: For 110631/112796 co-relation queries the response was YES. [2022-12-13 11:47:31,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56832 conditions, 17323 events. 3578/17323 cut-off events. For 110631/112796 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 231612 event pairs, 945 based on Foata normal form. 41/9769 useless extension candidates. Maximal degree in co-relation 53711. Up to 3047 conditions per place. [2022-12-13 11:47:32,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 416 transitions, 7826 flow [2022-12-13 11:47:32,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 8006 [2022-12-13 11:47:32,042 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:47:32,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2144 [2022-12-13 11:47:32,043 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 416 transitions, 7826 flow [2022-12-13 11:47:32,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-13 11:47:32,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:32,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:32,049 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-13 11:47:32,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:47:32,248 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:47:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1272507940, now seen corresponding path program 2 times [2022-12-13 11:47:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:32,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061478593] [2022-12-13 11:47:32,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:32,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:32,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061478593] [2022-12-13 11:47:32,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061478593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:47:32,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756455728] [2022-12-13 11:47:32,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:47:32,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:47:32,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:47:32,958 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-13 11:47:32,959 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-13 11:47:33,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:47:33,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:47:33,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-13 11:47:33,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:47:33,111 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-13 11:47:33,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 11:47:33,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:47:33,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-12-13 11:47:33,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:47:33,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-12-13 11:47:33,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-13 11:47:35,418 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_16_49 Int) (aux_mod_v_arrayElimCell_16_49 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_16_49 4294967296))) (and (<= (+ .cse0 aux_mod_v_arrayElimCell_16_49 1) 0) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_16_49)) 4294967296)) (< 0 (+ .cse0 aux_mod_v_arrayElimCell_16_49 4294967297)) (< aux_mod_v_arrayElimCell_16_49 4294967296) (<= 4294966496 aux_mod_v_arrayElimCell_16_49)))) is different from true [2022-12-13 11:47:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 11:47:35,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:47:35,559 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_595 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_595) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-13 11:47:35,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:47:35,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-13 11:47:35,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 49 [2022-12-13 11:47:35,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-13 11:47:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 11:47:35,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756455728] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:47:35,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:47:35,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-13 11:47:35,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245679792] [2022-12-13 11:47:35,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:47:35,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 11:47:35,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:35,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 11:47:35,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=185, Unknown=2, NotChecked=58, Total=306 [2022-12-13 11:47:35,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 94 [2022-12-13 11:47:35,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 416 transitions, 7826 flow. Second operand has 18 states, 18 states have (on average 11.666666666666666) internal successors, (210), 18 states have internal predecessors, (210), 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-13 11:47:35,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:35,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 94 [2022-12-13 11:47:35,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand