/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 23:25:04,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 23:25:04,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 23:25:04,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 23:25:04,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 23:25:04,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 23:25:04,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 23:25:04,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 23:25:04,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 23:25:04,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 23:25:04,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 23:25:04,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 23:25:04,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 23:25:04,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 23:25:04,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 23:25:04,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 23:25:04,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 23:25:04,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 23:25:04,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 23:25:04,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 23:25:04,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 23:25:04,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 23:25:04,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 23:25:04,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 23:25:04,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 23:25:04,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 23:25:04,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 23:25:04,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 23:25:04,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 23:25:04,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 23:25:04,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 23:25:04,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 23:25:04,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 23:25:04,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 23:25:04,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 23:25:04,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 23:25:04,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 23:25:04,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 23:25:04,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 23:25:04,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 23:25:04,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 23:25:04,209 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-20 23:25:04,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 23:25:04,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 23:25:04,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 23:25:04,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 23:25:04,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 23:25:04,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 23:25:04,235 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 23:25:04,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 23:25:04,235 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 23:25:04,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 23:25:04,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 23:25:04,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 23:25:04,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 23:25:04,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 23:25:04,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 23:25:04,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 23:25:04,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 23:25:04,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 23:25:04,238 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 23:25:04,238 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 23:25:04,238 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-09-20 23:25:04,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 23:25:04,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 23:25:04,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 23:25:04,433 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 23:25:04,434 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 23:25:04,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-09-20 23:25:04,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b594a58/e5e5f592718149b29af58af655e68464/FLAG682c27542 [2022-09-20 23:25:04,892 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 23:25:04,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2022-09-20 23:25:04,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b594a58/e5e5f592718149b29af58af655e68464/FLAG682c27542 [2022-09-20 23:25:04,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b594a58/e5e5f592718149b29af58af655e68464 [2022-09-20 23:25:04,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 23:25:04,916 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 23:25:04,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 23:25:04,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 23:25:04,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 23:25:04,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:25:04" (1/1) ... [2022-09-20 23:25:04,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282c2375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:04, skipping insertion in model container [2022-09-20 23:25:04,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:25:04" (1/1) ... [2022-09-20 23:25:04,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 23:25:04,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 23:25:05,144 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-09-20 23:25:05,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 23:25:05,161 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 23:25:05,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-09-20 23:25:05,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 23:25:05,191 INFO L208 MainTranslator]: Completed translation [2022-09-20 23:25:05,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05 WrapperNode [2022-09-20 23:25:05,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 23:25:05,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 23:25:05,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 23:25:05,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 23:25:05,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05" (1/1) ... [2022-09-20 23:25:05,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05" (1/1) ... [2022-09-20 23:25:05,217 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-09-20 23:25:05,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 23:25:05,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 23:25:05,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 23:25:05,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 23:25:05,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05" (1/1) ... [2022-09-20 23:25:05,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05" (1/1) ... [2022-09-20 23:25:05,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05" (1/1) ... [2022-09-20 23:25:05,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05" (1/1) ... [2022-09-20 23:25:05,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05" (1/1) ... [2022-09-20 23:25:05,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05" (1/1) ... [2022-09-20 23:25:05,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05" (1/1) ... [2022-09-20 23:25:05,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 23:25:05,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 23:25:05,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 23:25:05,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 23:25:05,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05" (1/1) ... [2022-09-20 23:25:05,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 23:25:05,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:25:05,276 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-09-20 23:25:05,283 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-09-20 23:25:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 23:25:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 23:25:05,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 23:25:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-20 23:25:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-20 23:25:05,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-20 23:25:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-20 23:25:05,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-20 23:25:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-20 23:25:05,312 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-20 23:25:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 23:25:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-20 23:25:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 23:25:05,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 23:25:05,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 23:25:05,313 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 23:25:05,391 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 23:25:05,393 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 23:25:05,591 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 23:25:05,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 23:25:05,598 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-20 23:25:05,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:25:05 BoogieIcfgContainer [2022-09-20 23:25:05,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 23:25:05,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 23:25:05,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 23:25:05,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 23:25:05,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 11:25:04" (1/3) ... [2022-09-20 23:25:05,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0d7f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:25:05, skipping insertion in model container [2022-09-20 23:25:05,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:25:05" (2/3) ... [2022-09-20 23:25:05,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0d7f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:25:05, skipping insertion in model container [2022-09-20 23:25:05,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:25:05" (3/3) ... [2022-09-20 23:25:05,605 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-09-20 23:25:05,617 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 23:25:05,617 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-20 23:25:05,617 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 23:25:05,657 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-20 23:25:05,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 160 transitions, 344 flow [2022-09-20 23:25:05,723 INFO L130 PetriNetUnfolder]: 12/157 cut-off events. [2022-09-20 23:25:05,724 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 23:25:05,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 157 events. 12/157 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-09-20 23:25:05,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 160 transitions, 344 flow [2022-09-20 23:25:05,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 146 transitions, 310 flow [2022-09-20 23:25:05,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 23:25:05,756 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@175e3ae3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 23:25:05,756 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-09-20 23:25:05,781 INFO L130 PetriNetUnfolder]: 12/145 cut-off events. [2022-09-20 23:25:05,781 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 23:25:05,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:05,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:05,782 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:05,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:05,786 INFO L85 PathProgramCache]: Analyzing trace with hash 535114423, now seen corresponding path program 1 times [2022-09-20 23:25:05,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:05,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469504530] [2022-09-20 23:25:05,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:05,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:25:06,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:06,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469504530] [2022-09-20 23:25:06,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469504530] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:25:06,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:25:06,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 23:25:06,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038316325] [2022-09-20 23:25:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:25:06,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-20 23:25:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:06,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-20 23:25:06,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-20 23:25:06,057 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 160 [2022-09-20 23:25:06,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 146 transitions, 310 flow. Second operand has 2 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 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-09-20 23:25:06,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:06,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 160 [2022-09-20 23:25:06,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:06,127 INFO L130 PetriNetUnfolder]: 4/138 cut-off events. [2022-09-20 23:25:06,127 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-09-20 23:25:06,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 138 events. 4/138 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 14/144 useless extension candidates. Maximal degree in co-relation 113. Up to 7 conditions per place. [2022-09-20 23:25:06,129 INFO L137 encePairwiseOnDemand]: 152/160 looper letters, 6 selfloop transitions, 0 changer transitions 4/138 dead transitions. [2022-09-20 23:25:06,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 138 transitions, 306 flow [2022-09-20 23:25:06,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-20 23:25:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-09-20 23:25:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 304 transitions. [2022-09-20 23:25:06,142 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.95 [2022-09-20 23:25:06,143 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 304 transitions. [2022-09-20 23:25:06,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 304 transitions. [2022-09-20 23:25:06,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:06,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 304 transitions. [2022-09-20 23:25:06,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 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-09-20 23:25:06,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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-09-20 23:25:06,157 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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-09-20 23:25:06,159 INFO L175 Difference]: Start difference. First operand has 144 places, 146 transitions, 310 flow. Second operand 2 states and 304 transitions. [2022-09-20 23:25:06,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 138 transitions, 306 flow [2022-09-20 23:25:06,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 138 transitions, 294 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-09-20 23:25:06,167 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 274 flow [2022-09-20 23:25:06,169 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=274, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2022-09-20 23:25:06,172 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -5 predicate places. [2022-09-20 23:25:06,172 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 274 flow [2022-09-20 23:25:06,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 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-09-20 23:25:06,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:06,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:06,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 23:25:06,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:06,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1367986410, now seen corresponding path program 1 times [2022-09-20 23:25:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:06,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123497060] [2022-09-20 23:25:06,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:25:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:06,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123497060] [2022-09-20 23:25:06,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123497060] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:25:06,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:25:06,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 23:25:06,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904503045] [2022-09-20 23:25:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:25:06,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 23:25:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:06,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 23:25:06,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-09-20 23:25:06,498 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 160 [2022-09-20 23:25:06,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 274 flow. Second operand has 7 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 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-09-20 23:25:06,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:06,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 160 [2022-09-20 23:25:06,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:06,666 INFO L130 PetriNetUnfolder]: 53/381 cut-off events. [2022-09-20 23:25:06,668 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-09-20 23:25:06,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 381 events. 53/381 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1421 event pairs, 9 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 499. Up to 49 conditions per place. [2022-09-20 23:25:06,678 INFO L137 encePairwiseOnDemand]: 151/160 looper letters, 47 selfloop transitions, 9 changer transitions 4/166 dead transitions. [2022-09-20 23:25:06,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 166 transitions, 470 flow [2022-09-20 23:25:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 23:25:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 23:25:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions. [2022-09-20 23:25:06,682 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7982142857142858 [2022-09-20 23:25:06,682 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions. [2022-09-20 23:25:06,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions. [2022-09-20 23:25:06,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:06,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions. [2022-09-20 23:25:06,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 states have internal predecessors, (894), 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-09-20 23:25:06,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 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-09-20 23:25:06,687 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 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-09-20 23:25:06,687 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 274 flow. Second operand 7 states and 894 transitions. [2022-09-20 23:25:06,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 166 transitions, 470 flow [2022-09-20 23:25:06,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 166 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 23:25:06,692 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 327 flow [2022-09-20 23:25:06,692 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=327, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2022-09-20 23:25:06,693 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 1 predicate places. [2022-09-20 23:25:06,693 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 327 flow [2022-09-20 23:25:06,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 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-09-20 23:25:06,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:06,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:06,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 23:25:06,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash 789214308, now seen corresponding path program 1 times [2022-09-20 23:25:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:06,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045649500] [2022-09-20 23:25:06,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:25:06,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:06,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045649500] [2022-09-20 23:25:06,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045649500] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:25:06,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:25:06,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 23:25:06,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188930228] [2022-09-20 23:25:06,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:25:06,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 23:25:06,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:06,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 23:25:06,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-20 23:25:06,794 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 160 [2022-09-20 23:25:06,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 327 flow. Second operand has 7 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 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-09-20 23:25:06,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:06,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 160 [2022-09-20 23:25:06,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:06,985 INFO L130 PetriNetUnfolder]: 189/805 cut-off events. [2022-09-20 23:25:06,985 INFO L131 PetriNetUnfolder]: For 69/80 co-relation queries the response was YES. [2022-09-20 23:25:06,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 805 events. 189/805 cut-off events. For 69/80 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4612 event pairs, 105 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 1279. Up to 252 conditions per place. [2022-09-20 23:25:06,993 INFO L137 encePairwiseOnDemand]: 151/160 looper letters, 41 selfloop transitions, 8 changer transitions 0/160 dead transitions. [2022-09-20 23:25:06,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 160 transitions, 473 flow [2022-09-20 23:25:06,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 23:25:06,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 23:25:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1026 transitions. [2022-09-20 23:25:06,995 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8015625 [2022-09-20 23:25:06,995 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1026 transitions. [2022-09-20 23:25:06,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1026 transitions. [2022-09-20 23:25:06,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:06,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1026 transitions. [2022-09-20 23:25:06,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.25) internal successors, (1026), 8 states have internal predecessors, (1026), 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-09-20 23:25:06,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 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-09-20 23:25:07,000 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 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-09-20 23:25:07,000 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 327 flow. Second operand 8 states and 1026 transitions. [2022-09-20 23:25:07,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 160 transitions, 473 flow [2022-09-20 23:25:07,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 160 transitions, 469 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-09-20 23:25:07,007 INFO L231 Difference]: Finished difference. Result has 151 places, 143 transitions, 359 flow [2022-09-20 23:25:07,007 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=359, PETRI_PLACES=151, PETRI_TRANSITIONS=143} [2022-09-20 23:25:07,009 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 7 predicate places. [2022-09-20 23:25:07,009 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 143 transitions, 359 flow [2022-09-20 23:25:07,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 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-09-20 23:25:07,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:07,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:07,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 23:25:07,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:07,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:07,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1946452380, now seen corresponding path program 1 times [2022-09-20 23:25:07,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:07,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104701927] [2022-09-20 23:25:07,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:07,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:25:07,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:07,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104701927] [2022-09-20 23:25:07,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104701927] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:25:07,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:25:07,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 23:25:07,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974603682] [2022-09-20 23:25:07,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:25:07,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 23:25:07,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:07,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 23:25:07,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-09-20 23:25:07,212 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 160 [2022-09-20 23:25:07,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 143 transitions, 359 flow. Second operand has 10 states, 10 states have (on average 104.1) internal successors, (1041), 10 states have internal predecessors, (1041), 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-09-20 23:25:07,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:07,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 160 [2022-09-20 23:25:07,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:07,616 INFO L130 PetriNetUnfolder]: 852/2288 cut-off events. [2022-09-20 23:25:07,616 INFO L131 PetriNetUnfolder]: For 316/338 co-relation queries the response was YES. [2022-09-20 23:25:07,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 2288 events. 852/2288 cut-off events. For 316/338 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17361 event pairs, 597 based on Foata normal form. 21/1986 useless extension candidates. Maximal degree in co-relation 3996. Up to 1077 conditions per place. [2022-09-20 23:25:07,634 INFO L137 encePairwiseOnDemand]: 146/160 looper letters, 65 selfloop transitions, 13 changer transitions 0/172 dead transitions. [2022-09-20 23:25:07,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 172 transitions, 583 flow [2022-09-20 23:25:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 23:25:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 23:25:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1379 transitions. [2022-09-20 23:25:07,637 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6629807692307692 [2022-09-20 23:25:07,637 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1379 transitions. [2022-09-20 23:25:07,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1379 transitions. [2022-09-20 23:25:07,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:07,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1379 transitions. [2022-09-20 23:25:07,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 106.07692307692308) internal successors, (1379), 13 states have internal predecessors, (1379), 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-09-20 23:25:07,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 160.0) internal successors, (2240), 14 states have internal predecessors, (2240), 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-09-20 23:25:07,645 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 160.0) internal successors, (2240), 14 states have internal predecessors, (2240), 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-09-20 23:25:07,645 INFO L175 Difference]: Start difference. First operand has 151 places, 143 transitions, 359 flow. Second operand 13 states and 1379 transitions. [2022-09-20 23:25:07,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 172 transitions, 583 flow [2022-09-20 23:25:07,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 172 transitions, 573 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 23:25:07,649 INFO L231 Difference]: Finished difference. Result has 164 places, 147 transitions, 402 flow [2022-09-20 23:25:07,649 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=402, PETRI_PLACES=164, PETRI_TRANSITIONS=147} [2022-09-20 23:25:07,650 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 20 predicate places. [2022-09-20 23:25:07,650 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 147 transitions, 402 flow [2022-09-20 23:25:07,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 104.1) internal successors, (1041), 10 states have internal predecessors, (1041), 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-09-20 23:25:07,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:07,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:07,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 23:25:07,655 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:07,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2089491774, now seen corresponding path program 1 times [2022-09-20 23:25:07,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:07,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039912303] [2022-09-20 23:25:07,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:25:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:07,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039912303] [2022-09-20 23:25:07,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039912303] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:25:07,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:25:07,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 23:25:07,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841104876] [2022-09-20 23:25:07,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:25:07,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 23:25:07,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:07,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 23:25:07,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-09-20 23:25:07,808 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 160 [2022-09-20 23:25:07,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 147 transitions, 402 flow. Second operand has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-09-20 23:25:07,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:07,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 160 [2022-09-20 23:25:07,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:08,166 INFO L130 PetriNetUnfolder]: 640/1571 cut-off events. [2022-09-20 23:25:08,166 INFO L131 PetriNetUnfolder]: For 402/420 co-relation queries the response was YES. [2022-09-20 23:25:08,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3031 conditions, 1571 events. 640/1571 cut-off events. For 402/420 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10401 event pairs, 371 based on Foata normal form. 18/1416 useless extension candidates. Maximal degree in co-relation 3016. Up to 747 conditions per place. [2022-09-20 23:25:08,178 INFO L137 encePairwiseOnDemand]: 147/160 looper letters, 49 selfloop transitions, 7 changer transitions 21/171 dead transitions. [2022-09-20 23:25:08,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 171 transitions, 614 flow [2022-09-20 23:25:08,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 23:25:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 23:25:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1288 transitions. [2022-09-20 23:25:08,181 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6708333333333333 [2022-09-20 23:25:08,181 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1288 transitions. [2022-09-20 23:25:08,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1288 transitions. [2022-09-20 23:25:08,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:08,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1288 transitions. [2022-09-20 23:25:08,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 107.33333333333333) internal successors, (1288), 12 states have internal predecessors, (1288), 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-09-20 23:25:08,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 160.0) internal successors, (2080), 13 states have internal predecessors, (2080), 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-09-20 23:25:08,186 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 160.0) internal successors, (2080), 13 states have internal predecessors, (2080), 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-09-20 23:25:08,186 INFO L175 Difference]: Start difference. First operand has 164 places, 147 transitions, 402 flow. Second operand 12 states and 1288 transitions. [2022-09-20 23:25:08,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 171 transitions, 614 flow [2022-09-20 23:25:08,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 171 transitions, 597 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-09-20 23:25:08,191 INFO L231 Difference]: Finished difference. Result has 170 places, 141 transitions, 365 flow [2022-09-20 23:25:08,191 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=365, PETRI_PLACES=170, PETRI_TRANSITIONS=141} [2022-09-20 23:25:08,193 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 26 predicate places. [2022-09-20 23:25:08,194 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 141 transitions, 365 flow [2022-09-20 23:25:08,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 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-09-20 23:25:08,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:08,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:08,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 23:25:08,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2006900253, now seen corresponding path program 1 times [2022-09-20 23:25:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:08,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207462706] [2022-09-20 23:25:08,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:25:08,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:08,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207462706] [2022-09-20 23:25:08,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207462706] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:08,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81201994] [2022-09-20 23:25:08,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:08,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:08,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:25:08,324 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-09-20 23:25:08,325 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-09-20 23:25:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:08,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-20 23:25:08,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:25:08,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:25:08,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:25:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:25:08,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81201994] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:25:08,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:25:08,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-09-20 23:25:08,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542287567] [2022-09-20 23:25:08,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:25:08,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-20 23:25:08,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:08,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-20 23:25:08,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-09-20 23:25:08,783 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 160 [2022-09-20 23:25:08,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 141 transitions, 365 flow. Second operand has 18 states, 18 states have (on average 116.88888888888889) internal successors, (2104), 18 states have internal predecessors, (2104), 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-09-20 23:25:08,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:08,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 160 [2022-09-20 23:25:08,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:09,323 INFO L130 PetriNetUnfolder]: 1410/2977 cut-off events. [2022-09-20 23:25:09,323 INFO L131 PetriNetUnfolder]: For 952/952 co-relation queries the response was YES. [2022-09-20 23:25:09,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6356 conditions, 2977 events. 1410/2977 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22827 event pairs, 343 based on Foata normal form. 9/2896 useless extension candidates. Maximal degree in co-relation 6339. Up to 616 conditions per place. [2022-09-20 23:25:09,350 INFO L137 encePairwiseOnDemand]: 148/160 looper letters, 79 selfloop transitions, 19 changer transitions 0/201 dead transitions. [2022-09-20 23:25:09,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 201 transitions, 728 flow [2022-09-20 23:25:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 23:25:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 23:25:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1581 transitions. [2022-09-20 23:25:09,353 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7600961538461538 [2022-09-20 23:25:09,353 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1581 transitions. [2022-09-20 23:25:09,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1581 transitions. [2022-09-20 23:25:09,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:09,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1581 transitions. [2022-09-20 23:25:09,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.61538461538461) internal successors, (1581), 13 states have internal predecessors, (1581), 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-09-20 23:25:09,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 160.0) internal successors, (2240), 14 states have internal predecessors, (2240), 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-09-20 23:25:09,359 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 160.0) internal successors, (2240), 14 states have internal predecessors, (2240), 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-09-20 23:25:09,360 INFO L175 Difference]: Start difference. First operand has 170 places, 141 transitions, 365 flow. Second operand 13 states and 1581 transitions. [2022-09-20 23:25:09,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 201 transitions, 728 flow [2022-09-20 23:25:09,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 201 transitions, 665 flow, removed 24 selfloop flow, removed 14 redundant places. [2022-09-20 23:25:09,367 INFO L231 Difference]: Finished difference. Result has 161 places, 154 transitions, 433 flow [2022-09-20 23:25:09,368 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=433, PETRI_PLACES=161, PETRI_TRANSITIONS=154} [2022-09-20 23:25:09,368 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 17 predicate places. [2022-09-20 23:25:09,368 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 154 transitions, 433 flow [2022-09-20 23:25:09,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 116.88888888888889) internal successors, (2104), 18 states have internal predecessors, (2104), 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-09-20 23:25:09,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:09,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:09,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-09-20 23:25:09,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-09-20 23:25:09,587 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:09,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash -850317411, now seen corresponding path program 2 times [2022-09-20 23:25:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:09,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897543572] [2022-09-20 23:25:09,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:09,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:09,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:09,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897543572] [2022-09-20 23:25:09,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897543572] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:09,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040131900] [2022-09-20 23:25:09,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 23:25:09,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:09,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:25:09,672 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-09-20 23:25:09,674 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-09-20 23:25:09,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-20 23:25:09,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:25:09,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-20 23:25:09,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:25:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:09,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:25:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:10,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040131900] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:10,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 23:25:10,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-09-20 23:25:10,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552348950] [2022-09-20 23:25:10,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:25:10,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 23:25:10,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:10,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 23:25:10,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-09-20 23:25:10,019 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 160 [2022-09-20 23:25:10,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 154 transitions, 433 flow. Second operand has 9 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 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-09-20 23:25:10,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:10,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 160 [2022-09-20 23:25:10,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:10,446 INFO L130 PetriNetUnfolder]: 1568/3449 cut-off events. [2022-09-20 23:25:10,446 INFO L131 PetriNetUnfolder]: For 1409/1426 co-relation queries the response was YES. [2022-09-20 23:25:10,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7846 conditions, 3449 events. 1568/3449 cut-off events. For 1409/1426 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 27334 event pairs, 215 based on Foata normal form. 7/3147 useless extension candidates. Maximal degree in co-relation 7833. Up to 657 conditions per place. [2022-09-20 23:25:10,466 INFO L137 encePairwiseOnDemand]: 148/160 looper letters, 71 selfloop transitions, 31 changer transitions 0/205 dead transitions. [2022-09-20 23:25:10,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 205 transitions, 822 flow [2022-09-20 23:25:10,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 23:25:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 23:25:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1335 transitions. [2022-09-20 23:25:10,469 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7585227272727273 [2022-09-20 23:25:10,469 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1335 transitions. [2022-09-20 23:25:10,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1335 transitions. [2022-09-20 23:25:10,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:10,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1335 transitions. [2022-09-20 23:25:10,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.36363636363636) internal successors, (1335), 11 states have internal predecessors, (1335), 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-09-20 23:25:10,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 160.0) internal successors, (1920), 12 states have internal predecessors, (1920), 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-09-20 23:25:10,474 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 160.0) internal successors, (1920), 12 states have internal predecessors, (1920), 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-09-20 23:25:10,474 INFO L175 Difference]: Start difference. First operand has 161 places, 154 transitions, 433 flow. Second operand 11 states and 1335 transitions. [2022-09-20 23:25:10,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 205 transitions, 822 flow [2022-09-20 23:25:10,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 205 transitions, 815 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 23:25:10,480 INFO L231 Difference]: Finished difference. Result has 173 places, 172 transitions, 645 flow [2022-09-20 23:25:10,480 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=645, PETRI_PLACES=173, PETRI_TRANSITIONS=172} [2022-09-20 23:25:10,481 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 29 predicate places. [2022-09-20 23:25:10,481 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 172 transitions, 645 flow [2022-09-20 23:25:10,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 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-09-20 23:25:10,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:10,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:10,499 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-09-20 23:25:10,698 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,SelfDestructingSolverStorable6 [2022-09-20 23:25:10,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:10,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1309283735, now seen corresponding path program 3 times [2022-09-20 23:25:10,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:10,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899678334] [2022-09-20 23:25:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:10,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:10,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:10,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899678334] [2022-09-20 23:25:10,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899678334] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:10,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105830495] [2022-09-20 23:25:10,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-20 23:25:10,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:10,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:25:10,784 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-09-20 23:25:10,786 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-09-20 23:25:10,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-09-20 23:25:10,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:25:10,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-20 23:25:10,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:25:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:11,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:25:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:11,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105830495] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:11,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 23:25:11,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-09-20 23:25:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542394881] [2022-09-20 23:25:11,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:25:11,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 23:25:11,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:11,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 23:25:11,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-09-20 23:25:11,166 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 160 [2022-09-20 23:25:11,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 172 transitions, 645 flow. Second operand has 9 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 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-09-20 23:25:11,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:11,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 160 [2022-09-20 23:25:11,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:11,734 INFO L130 PetriNetUnfolder]: 1953/4360 cut-off events. [2022-09-20 23:25:11,734 INFO L131 PetriNetUnfolder]: For 6255/6288 co-relation queries the response was YES. [2022-09-20 23:25:11,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12330 conditions, 4360 events. 1953/4360 cut-off events. For 6255/6288 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 36413 event pairs, 367 based on Foata normal form. 25/3996 useless extension candidates. Maximal degree in co-relation 12311. Up to 765 conditions per place. [2022-09-20 23:25:11,771 INFO L137 encePairwiseOnDemand]: 147/160 looper letters, 87 selfloop transitions, 48 changer transitions 0/238 dead transitions. [2022-09-20 23:25:11,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 238 transitions, 1244 flow [2022-09-20 23:25:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 23:25:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 23:25:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1354 transitions. [2022-09-20 23:25:11,774 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7693181818181818 [2022-09-20 23:25:11,774 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1354 transitions. [2022-09-20 23:25:11,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1354 transitions. [2022-09-20 23:25:11,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:11,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1354 transitions. [2022-09-20 23:25:11,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 123.0909090909091) internal successors, (1354), 11 states have internal predecessors, (1354), 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-09-20 23:25:11,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 160.0) internal successors, (1920), 12 states have internal predecessors, (1920), 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-09-20 23:25:11,779 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 160.0) internal successors, (1920), 12 states have internal predecessors, (1920), 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-09-20 23:25:11,779 INFO L175 Difference]: Start difference. First operand has 173 places, 172 transitions, 645 flow. Second operand 11 states and 1354 transitions. [2022-09-20 23:25:11,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 238 transitions, 1244 flow [2022-09-20 23:25:11,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 238 transitions, 1215 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-09-20 23:25:11,817 INFO L231 Difference]: Finished difference. Result has 184 places, 192 transitions, 976 flow [2022-09-20 23:25:11,817 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=976, PETRI_PLACES=184, PETRI_TRANSITIONS=192} [2022-09-20 23:25:11,818 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 40 predicate places. [2022-09-20 23:25:11,818 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 192 transitions, 976 flow [2022-09-20 23:25:11,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 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-09-20 23:25:11,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:11,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:11,841 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-09-20 23:25:12,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:12,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:12,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:12,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1207516017, now seen corresponding path program 4 times [2022-09-20 23:25:12,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:12,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833347530] [2022-09-20 23:25:12,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:12,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:12,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:12,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833347530] [2022-09-20 23:25:12,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833347530] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:12,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609713705] [2022-09-20 23:25:12,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-20 23:25:12,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:12,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:25:12,132 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-09-20 23:25:12,133 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-09-20 23:25:12,198 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-20 23:25:12,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:25:12,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-20 23:25:12,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:25:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:12,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:25:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:12,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609713705] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:12,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 23:25:12,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-09-20 23:25:12,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330788919] [2022-09-20 23:25:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:25:12,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 23:25:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:12,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 23:25:12,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-09-20 23:25:12,492 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 160 [2022-09-20 23:25:12,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 192 transitions, 976 flow. Second operand has 9 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 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-09-20 23:25:12,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:12,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 160 [2022-09-20 23:25:12,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:13,171 INFO L130 PetriNetUnfolder]: 2019/4604 cut-off events. [2022-09-20 23:25:13,171 INFO L131 PetriNetUnfolder]: For 12086/12223 co-relation queries the response was YES. [2022-09-20 23:25:13,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14642 conditions, 4604 events. 2019/4604 cut-off events. For 12086/12223 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 39222 event pairs, 283 based on Foata normal form. 23/4223 useless extension candidates. Maximal degree in co-relation 14618. Up to 1185 conditions per place. [2022-09-20 23:25:13,206 INFO L137 encePairwiseOnDemand]: 147/160 looper letters, 78 selfloop transitions, 48 changer transitions 0/229 dead transitions. [2022-09-20 23:25:13,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 229 transitions, 1416 flow [2022-09-20 23:25:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 23:25:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 23:25:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1224 transitions. [2022-09-20 23:25:13,208 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.765 [2022-09-20 23:25:13,208 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1224 transitions. [2022-09-20 23:25:13,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1224 transitions. [2022-09-20 23:25:13,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:13,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1224 transitions. [2022-09-20 23:25:13,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.4) internal successors, (1224), 10 states have internal predecessors, (1224), 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-09-20 23:25:13,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 160.0) internal successors, (1760), 11 states have internal predecessors, (1760), 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-09-20 23:25:13,213 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 160.0) internal successors, (1760), 11 states have internal predecessors, (1760), 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-09-20 23:25:13,213 INFO L175 Difference]: Start difference. First operand has 184 places, 192 transitions, 976 flow. Second operand 10 states and 1224 transitions. [2022-09-20 23:25:13,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 229 transitions, 1416 flow [2022-09-20 23:25:13,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 229 transitions, 1382 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-09-20 23:25:13,264 INFO L231 Difference]: Finished difference. Result has 191 places, 199 transitions, 1189 flow [2022-09-20 23:25:13,265 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1189, PETRI_PLACES=191, PETRI_TRANSITIONS=199} [2022-09-20 23:25:13,265 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 47 predicate places. [2022-09-20 23:25:13,265 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 199 transitions, 1189 flow [2022-09-20 23:25:13,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 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-09-20 23:25:13,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:13,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:13,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-20 23:25:13,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:13,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:13,484 INFO L85 PathProgramCache]: Analyzing trace with hash -907574383, now seen corresponding path program 5 times [2022-09-20 23:25:13,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:13,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506753766] [2022-09-20 23:25:13,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:13,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:13,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506753766] [2022-09-20 23:25:13,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506753766] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:13,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383150767] [2022-09-20 23:25:13,584 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-09-20 23:25:13,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:13,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:25:13,600 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-09-20 23:25:13,601 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-09-20 23:25:13,667 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-20 23:25:13,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:25:13,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-09-20 23:25:13,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:25:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:13,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:25:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:13,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383150767] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:25:13,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:25:13,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-09-20 23:25:13,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934407177] [2022-09-20 23:25:13,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:25:13,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-09-20 23:25:13,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:13,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-09-20 23:25:13,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-09-20 23:25:13,771 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 160 [2022-09-20 23:25:13,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 199 transitions, 1189 flow. Second operand has 17 states, 17 states have (on average 113.47058823529412) internal successors, (1929), 17 states have internal predecessors, (1929), 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-09-20 23:25:13,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:13,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 160 [2022-09-20 23:25:13,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:15,605 INFO L130 PetriNetUnfolder]: 5157/10731 cut-off events. [2022-09-20 23:25:15,605 INFO L131 PetriNetUnfolder]: For 37796/38108 co-relation queries the response was YES. [2022-09-20 23:25:15,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35843 conditions, 10731 events. 5157/10731 cut-off events. For 37796/38108 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 95496 event pairs, 581 based on Foata normal form. 49/10234 useless extension candidates. Maximal degree in co-relation 35816. Up to 1075 conditions per place. [2022-09-20 23:25:15,722 INFO L137 encePairwiseOnDemand]: 144/160 looper letters, 237 selfloop transitions, 144 changer transitions 0/480 dead transitions. [2022-09-20 23:25:15,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 480 transitions, 3827 flow [2022-09-20 23:25:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-09-20 23:25:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-09-20 23:25:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2925 transitions. [2022-09-20 23:25:15,729 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.76171875 [2022-09-20 23:25:15,729 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2925 transitions. [2022-09-20 23:25:15,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2925 transitions. [2022-09-20 23:25:15,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:15,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2925 transitions. [2022-09-20 23:25:15,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 121.875) internal successors, (2925), 24 states have internal predecessors, (2925), 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-09-20 23:25:15,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 160.0) internal successors, (4000), 25 states have internal predecessors, (4000), 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-09-20 23:25:15,753 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 160.0) internal successors, (4000), 25 states have internal predecessors, (4000), 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-09-20 23:25:15,754 INFO L175 Difference]: Start difference. First operand has 191 places, 199 transitions, 1189 flow. Second operand 24 states and 2925 transitions. [2022-09-20 23:25:15,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 480 transitions, 3827 flow [2022-09-20 23:25:15,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 480 transitions, 3662 flow, removed 30 selfloop flow, removed 6 redundant places. [2022-09-20 23:25:15,931 INFO L231 Difference]: Finished difference. Result has 226 places, 302 transitions, 2834 flow [2022-09-20 23:25:15,932 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2834, PETRI_PLACES=226, PETRI_TRANSITIONS=302} [2022-09-20 23:25:15,932 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 82 predicate places. [2022-09-20 23:25:15,932 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 302 transitions, 2834 flow [2022-09-20 23:25:15,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 113.47058823529412) internal successors, (1929), 17 states have internal predecessors, (1929), 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-09-20 23:25:15,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:15,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:15,950 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-09-20 23:25:16,147 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,SelfDestructingSolverStorable9 [2022-09-20 23:25:16,148 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:16,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash -194221619, now seen corresponding path program 1 times [2022-09-20 23:25:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:16,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015392165] [2022-09-20 23:25:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:16,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:16,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:16,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015392165] [2022-09-20 23:25:16,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015392165] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:16,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108842617] [2022-09-20 23:25:16,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:16,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:16,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:25:16,238 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-09-20 23:25:16,239 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-09-20 23:25:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:16,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-09-20 23:25:16,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:25:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:16,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:25:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:16,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108842617] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:16,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 23:25:16,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-09-20 23:25:16,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351862977] [2022-09-20 23:25:16,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:25:16,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 23:25:16,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:16,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 23:25:16,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-09-20 23:25:16,509 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 160 [2022-09-20 23:25:16,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 302 transitions, 2834 flow. Second operand has 7 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 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-09-20 23:25:16,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:16,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 160 [2022-09-20 23:25:16,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:16,990 INFO L130 PetriNetUnfolder]: 1019/3075 cut-off events. [2022-09-20 23:25:16,991 INFO L131 PetriNetUnfolder]: For 24602/25471 co-relation queries the response was YES. [2022-09-20 23:25:17,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11793 conditions, 3075 events. 1019/3075 cut-off events. For 24602/25471 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 26162 event pairs, 206 based on Foata normal form. 211/3054 useless extension candidates. Maximal degree in co-relation 11749. Up to 657 conditions per place. [2022-09-20 23:25:17,031 INFO L137 encePairwiseOnDemand]: 152/160 looper letters, 99 selfloop transitions, 24 changer transitions 0/337 dead transitions. [2022-09-20 23:25:17,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 337 transitions, 3558 flow [2022-09-20 23:25:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 23:25:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 23:25:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2022-09-20 23:25:17,033 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7946428571428571 [2022-09-20 23:25:17,033 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2022-09-20 23:25:17,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2022-09-20 23:25:17,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:17,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2022-09-20 23:25:17,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 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-09-20 23:25:17,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 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-09-20 23:25:17,035 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 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-09-20 23:25:17,036 INFO L175 Difference]: Start difference. First operand has 226 places, 302 transitions, 2834 flow. Second operand 7 states and 890 transitions. [2022-09-20 23:25:17,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 337 transitions, 3558 flow [2022-09-20 23:25:17,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 337 transitions, 3417 flow, removed 33 selfloop flow, removed 9 redundant places. [2022-09-20 23:25:17,102 INFO L231 Difference]: Finished difference. Result has 224 places, 302 transitions, 2757 flow [2022-09-20 23:25:17,103 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=2684, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2757, PETRI_PLACES=224, PETRI_TRANSITIONS=302} [2022-09-20 23:25:17,103 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 80 predicate places. [2022-09-20 23:25:17,103 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 302 transitions, 2757 flow [2022-09-20 23:25:17,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 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-09-20 23:25:17,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:17,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:17,131 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-09-20 23:25:17,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:17,323 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:17,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2052650903, now seen corresponding path program 6 times [2022-09-20 23:25:17,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:17,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553911336] [2022-09-20 23:25:17,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:17,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:17,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:17,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553911336] [2022-09-20 23:25:17,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553911336] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:17,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817008786] [2022-09-20 23:25:17,403 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-09-20 23:25:17,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:17,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:25:17,405 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-09-20 23:25:17,406 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-09-20 23:25:17,481 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-09-20 23:25:17,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:25:17,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-20 23:25:17,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:25:17,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:17,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:25:17,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:17,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817008786] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:17,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 23:25:17,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2022-09-20 23:25:17,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569734960] [2022-09-20 23:25:17,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:25:17,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 23:25:17,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:17,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 23:25:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-09-20 23:25:17,720 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 160 [2022-09-20 23:25:17,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 302 transitions, 2757 flow. Second operand has 9 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 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-09-20 23:25:17,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:17,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 160 [2022-09-20 23:25:17,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:18,584 INFO L130 PetriNetUnfolder]: 2406/5571 cut-off events. [2022-09-20 23:25:18,584 INFO L131 PetriNetUnfolder]: For 29144/29439 co-relation queries the response was YES. [2022-09-20 23:25:18,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21079 conditions, 5571 events. 2406/5571 cut-off events. For 29144/29439 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 47107 event pairs, 422 based on Foata normal form. 61/5496 useless extension candidates. Maximal degree in co-relation 21038. Up to 1507 conditions per place. [2022-09-20 23:25:18,635 INFO L137 encePairwiseOnDemand]: 148/160 looper letters, 95 selfloop transitions, 120 changer transitions 0/335 dead transitions. [2022-09-20 23:25:18,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 335 transitions, 3344 flow [2022-09-20 23:25:18,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 23:25:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 23:25:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1220 transitions. [2022-09-20 23:25:18,636 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7625 [2022-09-20 23:25:18,636 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1220 transitions. [2022-09-20 23:25:18,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1220 transitions. [2022-09-20 23:25:18,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:18,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1220 transitions. [2022-09-20 23:25:18,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.0) internal successors, (1220), 10 states have internal predecessors, (1220), 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-09-20 23:25:18,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 160.0) internal successors, (1760), 11 states have internal predecessors, (1760), 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-09-20 23:25:18,640 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 160.0) internal successors, (1760), 11 states have internal predecessors, (1760), 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-09-20 23:25:18,640 INFO L175 Difference]: Start difference. First operand has 224 places, 302 transitions, 2757 flow. Second operand 10 states and 1220 transitions. [2022-09-20 23:25:18,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 335 transitions, 3344 flow [2022-09-20 23:25:18,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 335 transitions, 3313 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-09-20 23:25:18,811 INFO L231 Difference]: Finished difference. Result has 231 places, 304 transitions, 3167 flow [2022-09-20 23:25:18,812 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=2730, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3167, PETRI_PLACES=231, PETRI_TRANSITIONS=304} [2022-09-20 23:25:18,812 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 87 predicate places. [2022-09-20 23:25:18,812 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 304 transitions, 3167 flow [2022-09-20 23:25:18,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.22222222222223) internal successors, (1055), 9 states have internal predecessors, (1055), 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-09-20 23:25:18,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:18,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:18,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-20 23:25:19,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:19,028 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:19,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 819117479, now seen corresponding path program 1 times [2022-09-20 23:25:19,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:19,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518319334] [2022-09-20 23:25:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:19,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:19,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:19,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518319334] [2022-09-20 23:25:19,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518319334] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:19,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680011111] [2022-09-20 23:25:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:19,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:19,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:25:19,492 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:25:19,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-20 23:25:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:19,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 52 conjunts are in the unsatisfiable core [2022-09-20 23:25:19,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:25:19,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-20 23:25:19,923 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-20 23:25:19,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-20 23:25:20,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-20 23:25:20,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-09-20 23:25:20,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-09-20 23:25:20,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 23:25:20,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-20 23:25:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:25:20,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:25:21,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 treesize of output 8 [2022-09-20 23:25:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:25:21,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680011111] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:25:21,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:25:21,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 13] total 46 [2022-09-20 23:25:21,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299840592] [2022-09-20 23:25:21,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:25:21,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-09-20 23:25:21,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:25:21,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-09-20 23:25:21,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1742, Unknown=0, NotChecked=0, Total=2070 [2022-09-20 23:25:21,435 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 160 [2022-09-20 23:25:21,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 304 transitions, 3167 flow. Second operand has 46 states, 46 states have (on average 70.23913043478261) internal successors, (3231), 46 states have internal predecessors, (3231), 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-09-20 23:25:21,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:25:21,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 160 [2022-09-20 23:25:21,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:25:26,453 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L56-3-->L56-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_11 (+ |v_thread2Thread1of1ForFork1_#t~post3_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_3|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_11, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1][623], [161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 1005#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 50#L49-2true, 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), 17#L56-4true, Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 13#L65true]) [2022-09-20 23:25:26,454 INFO L383 tUnfolder$Statistics]: this new event has 106 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L386 tUnfolder$Statistics]: existing Event has 106 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L65-->L65-1: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_3) (+ v_~A~0.offset_3 (* v_thread3Thread1of1ForFork2_~i~2_7 4))) |v_thread3Thread1of1ForFork2_#t~mem6_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_#t~mem6=|v_thread3Thread1of1ForFork2_#t~mem6_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem6][367], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 50#L49-2true, 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 23#L65-1true, Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 29#L56-2true, Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0))]) [2022-09-20 23:25:26,454 INFO L383 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L65-->L65-1: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_3) (+ v_~A~0.offset_3 (* v_thread3Thread1of1ForFork2_~i~2_7 4))) |v_thread3Thread1of1ForFork2_#t~mem6_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_#t~mem6=|v_thread3Thread1of1ForFork2_#t~mem6_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem6][367], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 50#L49-2true, 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 23#L65-1true, Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 71#L56-3true, Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0))]) [2022-09-20 23:25:26,454 INFO L383 tUnfolder$Statistics]: this new event has 106 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L386 tUnfolder$Statistics]: existing Event has 106 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L65-->L65-1: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_3) (+ v_~A~0.offset_3 (* v_thread3Thread1of1ForFork2_~i~2_7 4))) |v_thread3Thread1of1ForFork2_#t~mem6_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_#t~mem6=|v_thread3Thread1of1ForFork2_#t~mem6_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem6][367], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 50#L49-2true, 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 23#L65-1true, Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), 28#L57-2true, Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0))]) [2022-09-20 23:25:26,454 INFO L383 tUnfolder$Statistics]: this new event has 104 ancestors and is cut-off event [2022-09-20 23:25:26,454 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-09-20 23:25:26,455 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-09-20 23:25:26,455 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-09-20 23:25:26,652 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L56-3-->L56-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_11 (+ |v_thread2Thread1of1ForFork1_#t~post3_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_3|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_11, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1][623], [161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 1005#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 98#L48-2true, Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), Black: 1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), 17#L56-4true, Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 13#L65true]) [2022-09-20 23:25:26,653 INFO L383 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L65-->L65-1: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_3) (+ v_~A~0.offset_3 (* v_thread3Thread1of1ForFork2_~i~2_7 4))) |v_thread3Thread1of1ForFork2_#t~mem6_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_#t~mem6=|v_thread3Thread1of1ForFork2_#t~mem6_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem6][367], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 98#L48-2true, Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 23#L65-1true, Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 29#L56-2true, Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0))]) [2022-09-20 23:25:26,653 INFO L383 tUnfolder$Statistics]: this new event has 106 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L386 tUnfolder$Statistics]: existing Event has 106 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L65-->L65-1: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_3) (+ v_~A~0.offset_3 (* v_thread3Thread1of1ForFork2_~i~2_7 4))) |v_thread3Thread1of1ForFork2_#t~mem6_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_#t~mem6=|v_thread3Thread1of1ForFork2_#t~mem6_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem6][367], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 98#L48-2true, Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 23#L65-1true, Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), 28#L57-2true, Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0))]) [2022-09-20 23:25:26,653 INFO L383 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-09-20 23:25:26,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L65-->L65-1: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_3) (+ v_~A~0.offset_3 (* v_thread3Thread1of1ForFork2_~i~2_7 4))) |v_thread3Thread1of1ForFork2_#t~mem6_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_#t~mem6=|v_thread3Thread1of1ForFork2_#t~mem6_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem6][367], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 98#L48-2true, Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 23#L65-1true, Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 71#L56-3true, Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0))]) [2022-09-20 23:25:26,654 INFO L383 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2022-09-20 23:25:26,654 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 23:25:26,654 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-09-20 23:25:26,654 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 23:25:26,860 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([379] L48-3-->L48-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_11 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_11, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0][568], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, 4050#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 29#L56-2true, Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 4079#(<= 1 ~N~0), Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), 35#L48-4true, Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 13#L65true]) [2022-09-20 23:25:26,860 INFO L383 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2022-09-20 23:25:26,860 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-09-20 23:25:26,860 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 23:25:26,860 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 23:25:26,860 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([379] L48-3-->L48-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_11 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_11, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0][568], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, 4050#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 4079#(<= 1 ~N~0), Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), 28#L57-2true, 35#L48-4true, Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 13#L65true]) [2022-09-20 23:25:26,860 INFO L383 tUnfolder$Statistics]: this new event has 106 ancestors and is cut-off event [2022-09-20 23:25:26,860 INFO L386 tUnfolder$Statistics]: existing Event has 106 ancestors and is cut-off event [2022-09-20 23:25:26,860 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 23:25:26,860 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 23:25:26,860 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([379] L48-3-->L48-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_11 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_11, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0][568], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, 4050#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 71#L56-3true, 4079#(<= 1 ~N~0), Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), 35#L48-4true, Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 13#L65true]) [2022-09-20 23:25:26,860 INFO L383 tUnfolder$Statistics]: this new event has 108 ancestors and is cut-off event [2022-09-20 23:25:26,860 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-09-20 23:25:26,860 INFO L386 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L56-3-->L56-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_11 (+ |v_thread2Thread1of1ForFork1_#t~post3_3| 1)) InVars {thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_3|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_11, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1][623], [161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 1005#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 152#L48-3true, 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), Black: 1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), 17#L56-4true, Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), 13#L65true]) [2022-09-20 23:25:26,861 INFO L383 tUnfolder$Statistics]: this new event has 108 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L386 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L65-->L65-1: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_3) (+ v_~A~0.offset_3 (* v_thread3Thread1of1ForFork2_~i~2_7 4))) |v_thread3Thread1of1ForFork2_#t~mem6_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_#t~mem6=|v_thread3Thread1of1ForFork2_#t~mem6_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem6][367], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 152#L48-3true, 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 23#L65-1true, Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), 29#L56-2true, Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0))]) [2022-09-20 23:25:26,861 INFO L383 tUnfolder$Statistics]: this new event has 107 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L65-->L65-1: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_3) (+ v_~A~0.offset_3 (* v_thread3Thread1of1ForFork2_~i~2_7 4))) |v_thread3Thread1of1ForFork2_#t~mem6_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_#t~mem6=|v_thread3Thread1of1ForFork2_#t~mem6_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem6][367], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 152#L48-3true, 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 23#L65-1true, Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), 28#L57-2true, Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0))]) [2022-09-20 23:25:26,861 INFO L383 tUnfolder$Statistics]: this new event has 106 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-09-20 23:25:26,861 INFO L386 tUnfolder$Statistics]: existing Event has 106 ancestors and is cut-off event [2022-09-20 23:25:26,862 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L65-->L65-1: Formula: (= (select (select |v_#memory_int_3| v_~A~0.base_3) (+ v_~A~0.offset_3 (* v_thread3Thread1of1ForFork2_~i~2_7 4))) |v_thread3Thread1of1ForFork2_#t~mem6_1|) InVars {#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} OutVars{#memory_int=|v_#memory_int_3|, ~A~0.base=v_~A~0.base_3, ~A~0.offset=v_~A~0.offset_3, thread3Thread1of1ForFork2_#t~mem6=|v_thread3Thread1of1ForFork2_#t~mem6_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem6][367], [1761#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 4052#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), 161#true, Black: 190#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 3268#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 3264#(and (or (< 0 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), 164#true, Black: 4079#(<= 1 ~N~0), 152#L48-3true, 1009#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 5554#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0)), Black: 4047#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1777#(<= 1 ~N~0), Black: 2517#(and (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4013#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2509#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0)), Black: 4033#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 2511#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)) (<= 1 ~N~0)), Black: 4035#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 2515#(and (< thread2Thread1of1ForFork1_~i~1 ~N~0) (<= 1 ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 4037#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4023#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 23#L65-1true, Black: 4031#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 4029#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 4021#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4043#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= thread3Thread1of1ForFork2_~i~2 ~M~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 4045#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), 59#L85-1true, Black: 1763#(and (< thread2Thread1of1ForFork1_~i~1 ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4019#(and (<= 0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1024#(<= 1 ~N~0), 5559#true, Black: 1759#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 4011#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1757#(and (<= 1 ~N~0) (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (<= 1 ~M~0))), 71#L56-3true, Black: 168#(and (= ~sum2~0 0) (= ~sum3~0 0) (= ~sum1~0 0)), Black: 167#(and (= ~sum2~0 0) (= ~sum1~0 0)), Black: 5552#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (< thread3Thread1of1ForFork2_~i~2 ~N~0))), Black: 5550#(and (or (< thread3Thread1of1ForFork2_~i~2 ~N~0) (< 0 ~M~0)) (<= 1 ~N~0)), Black: 1003#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 1007#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= thread3Thread1of1ForFork2_~i~2 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= ~M~0 0)), Black: 995#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0)), Black: 1001#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (= thread2Thread1of1ForFork1_~i~1 0) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0))]) [2022-09-20 23:25:26,862 INFO L383 tUnfolder$Statistics]: this new event has 108 ancestors and is cut-off event [2022-09-20 23:25:26,862 INFO L386 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-09-20 23:25:26,862 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-09-20 23:25:26,862 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-09-20 23:25:28,246 INFO L130 PetriNetUnfolder]: 18819/34566 cut-off events. [2022-09-20 23:25:28,247 INFO L131 PetriNetUnfolder]: For 205683/206741 co-relation queries the response was YES. [2022-09-20 23:25:28,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128956 conditions, 34566 events. 18819/34566 cut-off events. For 205683/206741 co-relation queries the response was YES. Maximal size of possible extension queue 1719. Compared 327897 event pairs, 3789 based on Foata normal form. 291/34645 useless extension candidates. Maximal degree in co-relation 128912. Up to 13593 conditions per place. [2022-09-20 23:25:28,968 INFO L137 encePairwiseOnDemand]: 131/160 looper letters, 535 selfloop transitions, 151 changer transitions 4/813 dead transitions. [2022-09-20 23:25:28,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 813 transitions, 9637 flow [2022-09-20 23:25:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-09-20 23:25:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-09-20 23:25:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2655 transitions. [2022-09-20 23:25:28,972 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.47410714285714284 [2022-09-20 23:25:28,972 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2655 transitions. [2022-09-20 23:25:28,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2655 transitions. [2022-09-20 23:25:28,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:25:28,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2655 transitions. [2022-09-20 23:25:28,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 75.85714285714286) internal successors, (2655), 35 states have internal predecessors, (2655), 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-09-20 23:25:28,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 160.0) internal successors, (5760), 36 states have internal predecessors, (5760), 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-09-20 23:25:28,981 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 160.0) internal successors, (5760), 36 states have internal predecessors, (5760), 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-09-20 23:25:28,981 INFO L175 Difference]: Start difference. First operand has 231 places, 304 transitions, 3167 flow. Second operand 35 states and 2655 transitions. [2022-09-20 23:25:28,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 813 transitions, 9637 flow [2022-09-20 23:25:31,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 813 transitions, 9495 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-09-20 23:25:31,148 INFO L231 Difference]: Finished difference. Result has 275 places, 441 transitions, 5392 flow [2022-09-20 23:25:31,149 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=3101, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=5392, PETRI_PLACES=275, PETRI_TRANSITIONS=441} [2022-09-20 23:25:31,149 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, 131 predicate places. [2022-09-20 23:25:31,149 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 441 transitions, 5392 flow [2022-09-20 23:25:31,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 70.23913043478261) internal successors, (3231), 46 states have internal predecessors, (3231), 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-09-20 23:25:31,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:25:31,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:25:31,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-09-20 23:25:31,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-09-20 23:25:31,367 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:25:31,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:25:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2018855815, now seen corresponding path program 1 times [2022-09-20 23:25:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:25:31,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601121397] [2022-09-20 23:25:31,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:25:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:25:32,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:25:32,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601121397] [2022-09-20 23:25:32,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601121397] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:25:32,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623036090] [2022-09-20 23:25:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:25:32,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:25:32,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:25:32,633 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:25:32,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-09-20 23:25:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:25:32,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 68 conjunts are in the unsatisfiable core [2022-09-20 23:25:32,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:25:32,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-09-20 23:25:33,110 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-20 23:25:33,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-09-20 23:25:33,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-20 23:25:33,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-09-20 23:25:34,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:25:34,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-20 23:25:34,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-09-20 23:25:34,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:25:34,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-09-20 23:25:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:25:34,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:25:35,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_370 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (mod (+ c_~sum1~0 |c_thread1Thread1of1ForFork0_#t~mem2|) 4294967296) (mod (+ c_~sum3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_370) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~sum2~0) 4294967296)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-09-20 23:25:35,361 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int) (v_ArrVal_370 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (mod (+ c_~sum1~0 |c_thread1Thread1of1ForFork0_#t~mem2|) 4294967296) (mod (+ c_~sum3~0 c_~sum2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_370) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) 4294967296)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-09-20 23:25:35,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int) (v_ArrVal_370 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (mod (+ c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4)))) 4294967296) (mod (+ c_~sum3~0 c_~sum2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_370) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) 4294967296)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-09-20 23:25:35,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int) (v_ArrVal_370 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (mod (+ c_~sum3~0 c_~sum2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_370) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) 4294967296) (mod (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~sum1~0) 4294967296)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-09-20 23:25:35,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_368))) (= (mod (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~sum1~0) 4294967296) (mod (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_370) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~sum3~0 c_~sum2~0) 4294967296))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-09-20 23:25:35,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_368))) (= (mod (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret9#1.base|) |c_ULTIMATE.start_main_#t~ret9#1.offset|) c_~sum1~0) 4294967296) (mod (+ c_~sum3~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_main_#t~ret9#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_main_#t~ret9#1.offset|)) c_~sum2~0) 4294967296))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-09-20 23:25:35,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_368))) (= (mod (+ c_~sum1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_uint_array_#res#1.offset|)) 4294967296) (mod (+ c_~sum3~0 c_~sum2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_uint_array_#res#1.offset| (* ~M~0 4)))) 4294967296))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-09-20 23:25:35,597 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (~M~0 Int) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_368))) (= (mod (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) c_~sum1~0) 4294967296) (mod (+ c_~sum3~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|)) c_~sum2~0) 4294967296))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-09-20 23:25:35,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:25:35,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 49 [2022-09-20 23:25:35,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:25:35,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 990 treesize of output 906 [2022-09-20 23:25:35,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:25:35,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 894 treesize of output 850 [2022-09-20 23:25:35,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 838 treesize of output 742 [2022-09-20 23:25:35,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 742 treesize of output 694 [2022-09-20 23:27:13,827 WARN L233 SmtUtils]: Spent 56.06s on a formula simplification. DAG size of input: 9304 DAG size of output: 9230 (called from [L 789] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-09-20 23:28:05,667 WARN L233 SmtUtils]: Spent 25.44s on a formula simplification. DAG size of input: 6618 DAG size of output: 6354 (called from [L 789] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2022-09-20 23:35:42,513 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-20 23:35:42,557 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-20 23:35:43,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-09-20 23:35:43,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown