/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 22:41:36,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 22:41:36,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 22:41:36,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 22:41:36,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 22:41:36,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 22:41:36,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 22:41:36,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 22:41:36,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 22:41:36,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 22:41:36,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 22:41:36,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 22:41:36,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 22:41:36,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 22:41:36,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 22:41:36,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 22:41:36,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 22:41:36,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 22:41:36,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 22:41:36,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 22:41:36,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 22:41:36,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 22:41:36,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 22:41:36,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 22:41:36,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 22:41:36,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 22:41:36,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 22:41:36,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 22:41:36,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 22:41:36,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 22:41:36,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 22:41:36,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 22:41:36,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 22:41:36,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 22:41:36,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 22:41:36,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 22:41:36,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 22:41:36,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 22:41:36,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 22:41:36,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 22:41:36,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 22:41:36,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 22:41:36,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 22:41:36,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 22:41:36,431 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 22:41:36,431 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 22:41:36,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 22:41:36,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 22:41:36,432 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 22:41:36,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 22:41:36,433 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 22:41:36,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 22:41:36,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 22:41:36,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 22:41:36,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 22:41:36,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 22:41:36,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 22:41:36,434 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 22:41:36,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 22:41:36,435 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 22:41:36,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 22:41:36,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 22:41:36,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 22:41:36,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 22:41:36,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 22:41:36,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:41:36,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 22:41:36,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 22:41:36,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 22:41:36,436 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 22:41:36,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 22:41:36,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 22:41:36,436 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 22:41:36,436 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 22:41:36,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 22:41:36,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 22:41:36,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 22:41:36,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 22:41:36,763 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 22:41:36,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-12-11 22:41:37,921 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 22:41:38,151 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 22:41:38,152 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2022-12-11 22:41:38,161 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e72ccc2/7c40fd6f4d3d4593bd1af4ab6bfd1ccf/FLAGfc9280643 [2022-12-11 22:41:38,174 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e72ccc2/7c40fd6f4d3d4593bd1af4ab6bfd1ccf [2022-12-11 22:41:38,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 22:41:38,178 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 22:41:38,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 22:41:38,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 22:41:38,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 22:41:38,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b0c6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38, skipping insertion in model container [2022-12-11 22:41:38,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 22:41:38,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 22:41:38,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:41:38,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:41:38,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:41:38,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:41:38,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:41:38,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:41:38,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:41:38,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:41:38,374 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-12-11 22:41:38,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:41:38,393 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 22:41:38,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:41:38,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:41:38,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:41:38,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:41:38,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:41:38,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:41:38,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:41:38,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:41:38,420 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-12-11 22:41:38,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:41:38,435 INFO L208 MainTranslator]: Completed translation [2022-12-11 22:41:38,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38 WrapperNode [2022-12-11 22:41:38,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 22:41:38,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 22:41:38,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 22:41:38,437 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 22:41:38,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,479 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 121 [2022-12-11 22:41:38,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 22:41:38,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 22:41:38,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 22:41:38,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 22:41:38,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,512 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 22:41:38,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 22:41:38,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 22:41:38,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 22:41:38,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (1/1) ... [2022-12-11 22:41:38,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:41:38,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:41:38,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 22:41:38,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 22:41:38,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 22:41:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 22:41:38,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 22:41:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 22:41:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 22:41:38,588 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 22:41:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 22:41:38,588 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 22:41:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-11 22:41:38,588 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-11 22:41:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 22:41:38,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 22:41:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 22:41:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-11 22:41:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 22:41:38,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 22:41:38,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 22:41:38,590 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 22:41:38,728 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 22:41:38,729 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 22:41:38,976 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 22:41:39,009 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 22:41:39,010 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-11 22:41:39,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:41:39 BoogieIcfgContainer [2022-12-11 22:41:39,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 22:41:39,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 22:41:39,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 22:41:39,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 22:41:39,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 10:41:38" (1/3) ... [2022-12-11 22:41:39,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76007452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:41:39, skipping insertion in model container [2022-12-11 22:41:39,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:41:38" (2/3) ... [2022-12-11 22:41:39,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76007452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:41:39, skipping insertion in model container [2022-12-11 22:41:39,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:41:39" (3/3) ... [2022-12-11 22:41:39,025 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2022-12-11 22:41:39,042 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 22:41:39,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 22:41:39,043 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 22:41:39,165 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-11 22:41:39,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 171 transitions, 366 flow [2022-12-11 22:41:39,304 INFO L130 PetriNetUnfolder]: 16/168 cut-off events. [2022-12-11 22:41:39,305 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 22:41:39,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 16/168 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 129. Up to 3 conditions per place. [2022-12-11 22:41:39,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 171 transitions, 366 flow [2022-12-11 22:41:39,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 158 transitions, 334 flow [2022-12-11 22:41:39,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 22:41:39,344 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;@5af2a7f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 22:41:39,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-11 22:41:39,399 INFO L130 PetriNetUnfolder]: 16/157 cut-off events. [2022-12-11 22:41:39,399 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 22:41:39,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:39,400 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:39,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:41:39,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:39,407 INFO L85 PathProgramCache]: Analyzing trace with hash 197139455, now seen corresponding path program 1 times [2022-12-11 22:41:39,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:39,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746824506] [2022-12-11 22:41:39,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:39,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:41:41,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:41,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746824506] [2022-12-11 22:41:41,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746824506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:41:41,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:41:41,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-11 22:41:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807108227] [2022-12-11 22:41:41,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:41:41,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 22:41:41,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:41,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 22:41:41,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-12-11 22:41:41,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 171 [2022-12-11 22:41:41,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 158 transitions, 334 flow. Second operand has 13 states, 13 states have (on average 99.46153846153847) internal successors, (1293), 13 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:41,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:41,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 171 [2022-12-11 22:41:41,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:41:42,671 INFO L130 PetriNetUnfolder]: 595/1605 cut-off events. [2022-12-11 22:41:42,671 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES. [2022-12-11 22:41:42,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 1605 events. 595/1605 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10216 event pairs, 259 based on Foata normal form. 10/1261 useless extension candidates. Maximal degree in co-relation 1337. Up to 300 conditions per place. [2022-12-11 22:41:42,689 INFO L137 encePairwiseOnDemand]: 131/171 looper letters, 106 selfloop transitions, 29 changer transitions 14/233 dead transitions. [2022-12-11 22:41:42,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 233 transitions, 824 flow [2022-12-11 22:41:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-11 22:41:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-11 22:41:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2289 transitions. [2022-12-11 22:41:42,712 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6084529505582137 [2022-12-11 22:41:42,720 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 21 predicate places. [2022-12-11 22:41:42,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 233 transitions, 824 flow [2022-12-11 22:41:42,730 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 219 transitions, 765 flow [2022-12-11 22:41:42,732 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 219 transitions, 765 flow [2022-12-11 22:41:42,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 99.46153846153847) internal successors, (1293), 13 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:42,733 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:42,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:42,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 22:41:42,734 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:41:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash 59581235, now seen corresponding path program 1 times [2022-12-11 22:41:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:42,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066429120] [2022-12-11 22:41:42,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:41:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:42,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066429120] [2022-12-11 22:41:42,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066429120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:41:42,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:41:42,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 22:41:42,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869771150] [2022-12-11 22:41:42,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:41:42,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 22:41:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:42,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 22:41:42,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-11 22:41:42,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 171 [2022-12-11 22:41:42,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 219 transitions, 765 flow. Second operand has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:42,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:42,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 171 [2022-12-11 22:41:42,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:41:43,443 INFO L130 PetriNetUnfolder]: 1171/2955 cut-off events. [2022-12-11 22:41:43,444 INFO L131 PetriNetUnfolder]: For 1050/1617 co-relation queries the response was YES. [2022-12-11 22:41:43,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6498 conditions, 2955 events. 1171/2955 cut-off events. For 1050/1617 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 21150 event pairs, 422 based on Foata normal form. 0/2370 useless extension candidates. Maximal degree in co-relation 2967. Up to 962 conditions per place. [2022-12-11 22:41:43,468 INFO L137 encePairwiseOnDemand]: 157/171 looper letters, 152 selfloop transitions, 18 changer transitions 4/286 dead transitions. [2022-12-11 22:41:43,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 286 transitions, 1422 flow [2022-12-11 22:41:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 22:41:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 22:41:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1385 transitions. [2022-12-11 22:41:43,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7363104731525785 [2022-12-11 22:41:43,473 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 18 predicate places. [2022-12-11 22:41:43,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 286 transitions, 1422 flow [2022-12-11 22:41:43,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 282 transitions, 1398 flow [2022-12-11 22:41:43,492 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 282 transitions, 1398 flow [2022-12-11 22:41:43,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:43,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:43,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:43,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 22:41:43,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:41:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:43,494 INFO L85 PathProgramCache]: Analyzing trace with hash 287754582, now seen corresponding path program 1 times [2022-12-11 22:41:43,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:43,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007288250] [2022-12-11 22:41:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:43,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:41:43,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:43,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007288250] [2022-12-11 22:41:43,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007288250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:41:43,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:41:43,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 22:41:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740982351] [2022-12-11 22:41:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:41:43,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 22:41:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:43,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 22:41:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-11 22:41:43,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 171 [2022-12-11 22:41:43,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 282 transitions, 1398 flow. Second operand has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:43,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:43,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 171 [2022-12-11 22:41:43,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:41:44,160 INFO L130 PetriNetUnfolder]: 1379/2742 cut-off events. [2022-12-11 22:41:44,160 INFO L131 PetriNetUnfolder]: For 3094/4303 co-relation queries the response was YES. [2022-12-11 22:41:44,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8153 conditions, 2742 events. 1379/2742 cut-off events. For 3094/4303 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 16261 event pairs, 338 based on Foata normal form. 34/2063 useless extension candidates. Maximal degree in co-relation 6424. Up to 1528 conditions per place. [2022-12-11 22:41:44,187 INFO L137 encePairwiseOnDemand]: 157/171 looper letters, 69 selfloop transitions, 10 changer transitions 75/260 dead transitions. [2022-12-11 22:41:44,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 260 transitions, 1544 flow [2022-12-11 22:41:44,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 22:41:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 22:41:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1371 transitions. [2022-12-11 22:41:44,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7288676236044657 [2022-12-11 22:41:44,192 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 28 predicate places. [2022-12-11 22:41:44,193 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 260 transitions, 1544 flow [2022-12-11 22:41:44,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 185 transitions, 930 flow [2022-12-11 22:41:44,210 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 185 transitions, 930 flow [2022-12-11 22:41:44,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:44,211 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:44,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:44,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 22:41:44,213 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:41:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1081674616, now seen corresponding path program 1 times [2022-12-11 22:41:44,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:44,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987625997] [2022-12-11 22:41:44,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:44,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:41:44,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:44,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987625997] [2022-12-11 22:41:44,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987625997] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:41:44,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194851863] [2022-12-11 22:41:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:44,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:44,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:41:44,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:41:44,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-11 22:41:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:44,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-11 22:41:44,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:41:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:41:44,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:41:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:41:44,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194851863] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 22:41:44,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 22:41:44,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-11 22:41:44,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059506080] [2022-12-11 22:41:44,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:41:44,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 22:41:44,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:44,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 22:41:44,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-11 22:41:44,775 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 171 [2022-12-11 22:41:44,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 185 transitions, 930 flow. Second operand has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:44,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:44,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 171 [2022-12-11 22:41:44,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:41:45,045 INFO L130 PetriNetUnfolder]: 902/1806 cut-off events. [2022-12-11 22:41:45,046 INFO L131 PetriNetUnfolder]: For 3258/4568 co-relation queries the response was YES. [2022-12-11 22:41:45,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6336 conditions, 1806 events. 902/1806 cut-off events. For 3258/4568 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10507 event pairs, 144 based on Foata normal form. 26/1408 useless extension candidates. Maximal degree in co-relation 5866. Up to 1113 conditions per place. [2022-12-11 22:41:45,065 INFO L137 encePairwiseOnDemand]: 163/171 looper letters, 84 selfloop transitions, 7 changer transitions 0/191 dead transitions. [2022-12-11 22:41:45,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 191 transitions, 1178 flow [2022-12-11 22:41:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 22:41:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 22:41:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2022-12-11 22:41:45,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2022-12-11 22:41:45,069 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 21 predicate places. [2022-12-11 22:41:45,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 191 transitions, 1178 flow [2022-12-11 22:41:45,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 191 transitions, 1178 flow [2022-12-11 22:41:45,083 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 191 transitions, 1178 flow [2022-12-11 22:41:45,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:45,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:45,084 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:45,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-11 22:41:45,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:45,294 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:41:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:45,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1985285890, now seen corresponding path program 1 times [2022-12-11 22:41:45,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:45,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332803145] [2022-12-11 22:41:45,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:45,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:41:45,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:45,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332803145] [2022-12-11 22:41:45,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332803145] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:41:45,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702371894] [2022-12-11 22:41:45,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:45,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:45,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:41:45,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:41:45,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-11 22:41:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:45,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-11 22:41:45,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:41:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:41:45,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:41:45,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:41:45,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702371894] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 22:41:45,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 22:41:45,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-11 22:41:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766558564] [2022-12-11 22:41:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:41:45,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 22:41:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:45,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 22:41:45,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-11 22:41:45,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 171 [2022-12-11 22:41:45,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 191 transitions, 1178 flow. Second operand has 7 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:45,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:45,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 171 [2022-12-11 22:41:45,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:41:46,139 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L76-1-->L72-2: Formula: (not (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][183], [57#L58-4true, 130#L72-2true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 78#L97-4true, 168#true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 10#L50-4true]) [2022-12-11 22:41:46,140 INFO L382 tUnfolder$Statistics]: this new event has 110 ancestors and is cut-off event [2022-12-11 22:41:46,140 INFO L385 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-12-11 22:41:46,140 INFO L385 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-12-11 22:41:46,140 INFO L385 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-12-11 22:41:46,140 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][184], [57#L58-4true, thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 78#L97-4true, 41#L73true, 168#true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0))]) [2022-12-11 22:41:46,140 INFO L382 tUnfolder$Statistics]: this new event has 110 ancestors and is cut-off event [2022-12-11 22:41:46,140 INFO L385 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-12-11 22:41:46,140 INFO L385 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-12-11 22:41:46,140 INFO L385 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-12-11 22:41:46,196 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L76-1-->L72-2: Formula: (not (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][183], [130#L72-2true, thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 78#L97-4true, 168#true, 259#(<= 1 ~N~0), 98#L58-2true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0))]) [2022-12-11 22:41:46,197 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,197 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,197 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,197 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,197 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][184], [thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 78#L97-4true, 41#L73true, 168#true, 259#(<= 1 ~N~0), 98#L58-2true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0))]) [2022-12-11 22:41:46,197 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,197 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,197 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,197 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,206 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([442] L76-1-->L72-2: Formula: (not (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][183], [130#L72-2true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 78#L97-4true, 98#L58-2true, 168#true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0))]) [2022-12-11 22:41:46,206 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,206 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,206 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,206 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,206 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,206 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][184], [thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 78#L97-4true, 41#L73true, 259#(<= 1 ~N~0), 98#L58-2true, 168#true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 10#L50-4true]) [2022-12-11 22:41:46,206 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,206 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,207 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,207 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,207 INFO L385 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-12-11 22:41:46,239 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][146], [thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 78#L97-4true, 168#true, 98#L58-2true, 36#L51true, 45#L80-1true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0))]) [2022-12-11 22:41:46,240 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:46,240 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,240 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,240 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,240 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][147], [69#L50-6true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 78#L97-4true, 98#L58-2true, 168#true, 259#(<= 1 ~N~0), 45#L80-1true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0))]) [2022-12-11 22:41:46,240 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:46,240 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,240 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,240 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:46,254 INFO L130 PetriNetUnfolder]: 1641/2987 cut-off events. [2022-12-11 22:41:46,254 INFO L131 PetriNetUnfolder]: For 11036/12411 co-relation queries the response was YES. [2022-12-11 22:41:46,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12425 conditions, 2987 events. 1641/2987 cut-off events. For 11036/12411 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18440 event pairs, 344 based on Foata normal form. 51/2271 useless extension candidates. Maximal degree in co-relation 11893. Up to 1838 conditions per place. [2022-12-11 22:41:46,282 INFO L137 encePairwiseOnDemand]: 163/171 looper letters, 112 selfloop transitions, 12 changer transitions 0/224 dead transitions. [2022-12-11 22:41:46,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 224 transitions, 1771 flow [2022-12-11 22:41:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 22:41:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 22:41:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-12-11 22:41:46,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7184628237259816 [2022-12-11 22:41:46,285 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 27 predicate places. [2022-12-11 22:41:46,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 224 transitions, 1771 flow [2022-12-11 22:41:46,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 224 transitions, 1771 flow [2022-12-11 22:41:46,306 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 224 transitions, 1771 flow [2022-12-11 22:41:46,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:46,306 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:46,306 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:46,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-11 22:41:46,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:46,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:41:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:46,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1974980996, now seen corresponding path program 1 times [2022-12-11 22:41:46,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:46,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73971599] [2022-12-11 22:41:46,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:46,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:41:46,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:46,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73971599] [2022-12-11 22:41:46,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73971599] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:41:46,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411723854] [2022-12-11 22:41:46,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:46,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:46,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:41:46,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:41:46,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-11 22:41:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:46,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-11 22:41:46,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:41:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:41:46,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:41:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:41:47,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411723854] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 22:41:47,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 22:41:47,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-11 22:41:47,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031308349] [2022-12-11 22:41:47,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:41:47,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 22:41:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 22:41:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-11 22:41:47,086 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 171 [2022-12-11 22:41:47,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 224 transitions, 1771 flow. Second operand has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:47,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:47,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 171 [2022-12-11 22:41:47,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:41:47,512 INFO L130 PetriNetUnfolder]: 1500/2799 cut-off events. [2022-12-11 22:41:47,512 INFO L131 PetriNetUnfolder]: For 14033/15590 co-relation queries the response was YES. [2022-12-11 22:41:47,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13441 conditions, 2799 events. 1500/2799 cut-off events. For 14033/15590 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 17106 event pairs, 214 based on Foata normal form. 64/2268 useless extension candidates. Maximal degree in co-relation 11716. Up to 1745 conditions per place. [2022-12-11 22:41:47,540 INFO L137 encePairwiseOnDemand]: 163/171 looper letters, 149 selfloop transitions, 14 changer transitions 0/263 dead transitions. [2022-12-11 22:41:47,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 263 transitions, 2574 flow [2022-12-11 22:41:47,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 22:41:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 22:41:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2022-12-11 22:41:47,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7184628237259816 [2022-12-11 22:41:47,544 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 33 predicate places. [2022-12-11 22:41:47,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 263 transitions, 2574 flow [2022-12-11 22:41:47,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 263 transitions, 2574 flow [2022-12-11 22:41:47,564 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 263 transitions, 2574 flow [2022-12-11 22:41:47,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:47,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:47,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:47,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-11 22:41:47,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:47,772 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:41:47,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2006593427, now seen corresponding path program 1 times [2022-12-11 22:41:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:47,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320084781] [2022-12-11 22:41:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-11 22:41:48,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:48,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320084781] [2022-12-11 22:41:48,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320084781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:41:48,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:41:48,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:41:48,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396497836] [2022-12-11 22:41:48,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:41:48,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:41:48,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:48,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:41:48,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:41:48,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 171 [2022-12-11 22:41:48,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 263 transitions, 2574 flow. Second operand has 5 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:48,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:48,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 171 [2022-12-11 22:41:48,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:41:48,553 INFO L130 PetriNetUnfolder]: 1946/3678 cut-off events. [2022-12-11 22:41:48,554 INFO L131 PetriNetUnfolder]: For 18878/20626 co-relation queries the response was YES. [2022-12-11 22:41:48,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18434 conditions, 3678 events. 1946/3678 cut-off events. For 18878/20626 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 24179 event pairs, 198 based on Foata normal form. 46/3149 useless extension candidates. Maximal degree in co-relation 17744. Up to 2133 conditions per place. [2022-12-11 22:41:48,589 INFO L137 encePairwiseOnDemand]: 166/171 looper letters, 140 selfloop transitions, 7 changer transitions 0/326 dead transitions. [2022-12-11 22:41:48,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 326 transitions, 3705 flow [2022-12-11 22:41:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-11 22:41:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-11 22:41:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 895 transitions. [2022-12-11 22:41:48,591 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8723196881091618 [2022-12-11 22:41:48,592 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 38 predicate places. [2022-12-11 22:41:48,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 326 transitions, 3705 flow [2022-12-11 22:41:48,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 326 transitions, 3705 flow [2022-12-11 22:41:48,618 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 326 transitions, 3705 flow [2022-12-11 22:41:48,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:48,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:48,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:48,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 22:41:48,619 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:41:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1978783123, now seen corresponding path program 2 times [2022-12-11 22:41:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:48,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335699885] [2022-12-11 22:41:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:41:48,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:48,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335699885] [2022-12-11 22:41:48,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335699885] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:41:48,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546410478] [2022-12-11 22:41:48,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 22:41:48,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:48,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:41:48,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:41:48,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-11 22:41:48,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 22:41:48,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:41:49,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-11 22:41:49,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:41:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:41:49,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:41:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:41:49,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546410478] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:41:49,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:41:49,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-11 22:41:49,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334161341] [2022-12-11 22:41:49,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:41:49,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 22:41:49,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:49,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 22:41:49,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-11 22:41:49,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 171 [2022-12-11 22:41:49,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 326 transitions, 3705 flow. Second operand has 12 states, 12 states have (on average 140.16666666666666) internal successors, (1682), 12 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:49,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:49,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 171 [2022-12-11 22:41:49,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:41:49,559 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][273], [thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 41#L73true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 2622#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 34#L58-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true]) [2022-12-11 22:41:49,559 INFO L382 tUnfolder$Statistics]: this new event has 108 ancestors and is cut-off event [2022-12-11 22:41:49,560 INFO L385 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-12-11 22:41:49,560 INFO L385 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-12-11 22:41:49,560 INFO L385 tUnfolder$Statistics]: existing Event has 108 ancestors and is cut-off event [2022-12-11 22:41:49,591 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][232], [thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 36#L51true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2622#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 34#L58-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true]) [2022-12-11 22:41:49,592 INFO L382 tUnfolder$Statistics]: this new event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,592 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,592 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,592 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,593 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][233], [thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2622#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 69#L50-6true, 34#L58-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true]) [2022-12-11 22:41:49,593 INFO L382 tUnfolder$Statistics]: this new event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,593 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,593 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,593 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,601 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][286], [thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 2622#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:49,601 INFO L382 tUnfolder$Statistics]: this new event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,602 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,602 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,602 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,602 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][287], [thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 2622#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), 10#L50-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 13#L59true, 2611#true]) [2022-12-11 22:41:49,602 INFO L382 tUnfolder$Statistics]: this new event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,602 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,602 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,603 INFO L385 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-12-11 22:41:49,734 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][301], [thread1Thread1of1ForFork1InUse, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 38#L50-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:49,734 INFO L382 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-12-11 22:41:49,736 INFO L385 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-12-11 22:41:49,736 INFO L385 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-12-11 22:41:49,737 INFO L385 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-12-11 22:41:49,737 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][302], [thread1Thread1of1ForFork1InUse, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 38#L50-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:49,737 INFO L382 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-12-11 22:41:49,737 INFO L385 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-12-11 22:41:49,737 INFO L385 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-12-11 22:41:49,737 INFO L385 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-12-11 22:41:49,787 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][232], [thread1Thread1of1ForFork1InUse, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 36#L51true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:49,788 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,788 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,788 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,788 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,788 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][233], [thread1Thread1of1ForFork1InUse, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 69#L50-6true, 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:49,788 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,788 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,788 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,788 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,789 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][319], [thread1Thread1of1ForFork1InUse, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:49,789 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,789 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,789 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,789 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,789 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][320], [thread1Thread1of1ForFork1InUse, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:49,789 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,789 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,789 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,789 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,793 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][301], [thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 38#L50-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 13#L59true, 2611#true]) [2022-12-11 22:41:49,794 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,794 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,794 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,794 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,794 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][302], [thread1Thread1of1ForFork1InUse, 26#L76-1true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 38#L50-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:49,794 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,794 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,794 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,794 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,794 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][306], [thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 41#L73true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 38#L50-3true, 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:49,794 INFO L382 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-12-11 22:41:49,794 INFO L385 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-12-11 22:41:49,795 INFO L385 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-12-11 22:41:49,795 INFO L385 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-12-11 22:41:49,897 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][337], [thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 41#L73true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 34#L58-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true]) [2022-12-11 22:41:49,898 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,898 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,898 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,898 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 22:41:49,898 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][319], [thread1Thread1of1ForFork1InUse, 26#L76-1true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:49,898 INFO L382 tUnfolder$Statistics]: this new event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,898 INFO L385 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-12-11 22:41:49,898 INFO L385 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-12-11 22:41:49,898 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,898 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][320], [thread1Thread1of1ForFork1InUse, 26#L76-1true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, 3481#(and (= ~p~0 0) (= thread3Thread1of1ForFork0_~cond~0 0) (= thread3Thread1of1ForFork0_~i~2 0)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:49,899 INFO L382 tUnfolder$Statistics]: this new event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,899 INFO L385 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-12-11 22:41:49,899 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,899 INFO L385 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-12-11 22:41:49,902 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][371], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 41#L73true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 34#L58-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true]) [2022-12-11 22:41:49,902 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,902 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,902 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,902 INFO L385 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-12-11 22:41:49,944 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][232], [thread1Thread1of1ForFork1InUse, 2618#true, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 36#L51true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 34#L58-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true]) [2022-12-11 22:41:49,944 INFO L382 tUnfolder$Statistics]: this new event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,945 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,945 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,945 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,949 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][233], [thread1Thread1of1ForFork1InUse, 2618#true, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 69#L50-6true, 34#L58-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true]) [2022-12-11 22:41:49,949 INFO L382 tUnfolder$Statistics]: this new event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,949 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,949 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,949 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,964 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][394], [thread1Thread1of1ForFork1InUse, 2618#true, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:49,965 INFO L382 tUnfolder$Statistics]: this new event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,965 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,965 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,965 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,965 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][395], [thread1Thread1of1ForFork1InUse, 2618#true, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:49,966 INFO L382 tUnfolder$Statistics]: this new event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,966 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,966 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:49,966 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:50,118 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][234], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 69#L50-6true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 98#L58-2true, 2611#true]) [2022-12-11 22:41:50,118 INFO L382 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,119 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,119 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,119 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,119 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][235], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 36#L51true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 98#L58-2true, 2611#true]) [2022-12-11 22:41:50,119 INFO L382 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,119 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,119 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,119 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,125 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][367], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 38#L50-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:50,125 INFO L382 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,125 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,125 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,125 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,125 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][368], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 38#L50-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:50,125 INFO L382 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,126 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,126 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,126 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,126 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][394], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:50,126 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,126 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,126 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,126 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,126 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][395], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:50,126 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,126 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,126 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,126 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,228 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][232], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 36#L51true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 34#L58-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true]) [2022-12-11 22:41:50,229 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,229 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,229 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,229 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,229 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][233], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 69#L50-6true, 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:50,229 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,229 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,229 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,229 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,239 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][232], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 36#L51true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:50,239 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,239 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,239 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,239 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,239 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,239 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][233], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 69#L50-6true, 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:50,239 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,240 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,240 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,240 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,240 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,240 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L77-->L79: Formula: (= (+ v_~csum~0_10 (select (select |v_#memory_int_31| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork0_~i~2_9 4)))) v_~csum~0_9) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_10} OutVars{~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_9, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_#t~mem5=|v_thread3Thread1of1ForFork0_#t~mem5_1|} AuxVars[] AssignedVars[~csum~0, thread3Thread1of1ForFork0_#t~mem5][432], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 153#L79true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 10#L50-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 98#L58-2true, 2611#true]) [2022-12-11 22:41:50,240 INFO L382 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,241 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,241 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,241 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,241 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][433], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 41#L73true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 98#L58-2true, 168#true, 2611#true]) [2022-12-11 22:41:50,241 INFO L382 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,241 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,241 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,242 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,248 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][367], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 107#L77true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 38#L50-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:50,248 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,248 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,249 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,249 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,249 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][368], [thread1Thread1of1ForFork1InUse, 2618#true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 107#L77true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 38#L50-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:50,249 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,249 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,250 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,250 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,250 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L77-->L79: Formula: (= (+ v_~csum~0_10 (select (select |v_#memory_int_31| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork0_~i~2_9 4)))) v_~csum~0_9) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_10} OutVars{~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_9, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_#t~mem5=|v_thread3Thread1of1ForFork0_#t~mem5_1|} AuxVars[] AssignedVars[~csum~0, thread3Thread1of1ForFork0_#t~mem5][413], [thread1Thread1of1ForFork1InUse, 2618#true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 153#L79true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 38#L50-3true, 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:50,250 INFO L382 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,250 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,250 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,250 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,250 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L77-->L79: Formula: (= (+ v_~csum~0_10 (select (select |v_#memory_int_31| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork0_~i~2_9 4)))) v_~csum~0_9) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_10} OutVars{~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_9, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_#t~mem5=|v_thread3Thread1of1ForFork0_#t~mem5_1|} AuxVars[] AssignedVars[~csum~0, thread3Thread1of1ForFork0_#t~mem5][453], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 153#L79true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 34#L58-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true]) [2022-12-11 22:41:50,250 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,251 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,251 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,251 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,251 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][394], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 107#L77true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:50,251 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,251 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,251 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,251 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,251 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][395], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 107#L77true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:50,251 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,252 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,252 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,252 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,253 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][414], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 38#L50-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:50,253 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,253 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,253 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,253 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,253 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][415], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 38#L50-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:50,253 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,253 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,253 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,254 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,254 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][452], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 41#L73true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:50,254 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,254 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,254 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,254 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,254 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][416], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 41#L73true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 38#L50-3true, 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:50,254 INFO L382 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,254 INFO L385 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-12-11 22:41:50,254 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,255 INFO L385 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-12-11 22:41:50,255 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][454], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 26#L76-1true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:50,255 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,255 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,255 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,255 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,255 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][455], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:50,255 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,255 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,255 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,256 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,305 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][394], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:50,305 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,306 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,306 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,306 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,306 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,306 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][395], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:50,306 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,306 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,306 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,306 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,306 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,308 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([449] L77-->L79: Formula: (= (+ v_~csum~0_10 (select (select |v_#memory_int_31| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork0_~i~2_9 4)))) v_~csum~0_9) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_10} OutVars{~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_9, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_#t~mem5=|v_thread3Thread1of1ForFork0_#t~mem5_1|} AuxVars[] AssignedVars[~csum~0, thread3Thread1of1ForFork0_#t~mem5][453], [thread1Thread1of1ForFork1InUse, 2618#true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 153#L79true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:50,308 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,309 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,309 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,309 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,309 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,309 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][394], [thread1Thread1of1ForFork1InUse, 2618#true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 107#L77true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:50,309 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,309 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,309 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,309 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,309 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,309 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][395], [thread1Thread1of1ForFork1InUse, 2618#true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 107#L77true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:50,310 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,310 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,310 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,310 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,310 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,310 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][452], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 41#L73true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:50,310 INFO L382 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,311 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,311 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,311 INFO L385 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-12-11 22:41:50,311 INFO L385 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-12-11 22:41:50,311 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][454], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 26#L76-1true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 67#L58-5true, 168#true, 2611#true]) [2022-12-11 22:41:50,311 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,311 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,311 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,311 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,311 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,311 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][455], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 26#L76-1true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 13#L59true, 168#true, 2611#true]) [2022-12-11 22:41:50,312 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,312 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,312 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,312 INFO L385 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,312 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,344 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L77-->L79: Formula: (= (+ v_~csum~0_10 (select (select |v_#memory_int_31| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork0_~i~2_9 4)))) v_~csum~0_9) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_10} OutVars{~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_9, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_#t~mem5=|v_thread3Thread1of1ForFork0_#t~mem5_1|} AuxVars[] AssignedVars[~csum~0, thread3Thread1of1ForFork0_#t~mem5][432], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 131#L64true, 259#(<= 1 ~N~0), 153#L79true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true]) [2022-12-11 22:41:50,344 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,344 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:50,345 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,345 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,345 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][433], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 41#L73true, 131#L64true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true]) [2022-12-11 22:41:50,345 INFO L382 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-12-11 22:41:50,346 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,346 INFO L385 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-12-11 22:41:50,346 INFO L385 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-12-11 22:41:50,501 INFO L130 PetriNetUnfolder]: 4280/7441 cut-off events. [2022-12-11 22:41:50,501 INFO L131 PetriNetUnfolder]: For 48108/53183 co-relation queries the response was YES. [2022-12-11 22:41:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42241 conditions, 7441 events. 4280/7441 cut-off events. For 48108/53183 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 51604 event pairs, 410 based on Foata normal form. 248/6560 useless extension candidates. Maximal degree in co-relation 41264. Up to 4391 conditions per place. [2022-12-11 22:41:50,598 INFO L137 encePairwiseOnDemand]: 163/171 looper letters, 340 selfloop transitions, 23 changer transitions 16/523 dead transitions. [2022-12-11 22:41:50,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 523 transitions, 7241 flow [2022-12-11 22:41:50,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 22:41:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 22:41:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1469 transitions. [2022-12-11 22:41:50,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8590643274853801 [2022-12-11 22:41:50,605 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 47 predicate places. [2022-12-11 22:41:50,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 523 transitions, 7241 flow [2022-12-11 22:41:50,667 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 507 transitions, 6965 flow [2022-12-11 22:41:50,667 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 507 transitions, 6965 flow [2022-12-11 22:41:50,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 140.16666666666666) internal successors, (1682), 12 states have internal predecessors, (1682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:50,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:50,668 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:50,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-11 22:41:50,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:50,875 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:41:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:50,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2039607169, now seen corresponding path program 3 times [2022-12-11 22:41:50,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:50,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626980972] [2022-12-11 22:41:50,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:50,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-11 22:41:51,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:51,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626980972] [2022-12-11 22:41:51,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626980972] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:41:51,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586682946] [2022-12-11 22:41:51,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 22:41:51,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:51,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:41:51,138 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:41:51,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-11 22:41:51,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-11 22:41:51,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:41:51,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-11 22:41:51,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:41:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-11 22:41:51,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:41:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-11 22:41:51,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586682946] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:41:51,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:41:51,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-12-11 22:41:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880530245] [2022-12-11 22:41:51,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:41:51,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-11 22:41:51,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:51,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-11 22:41:51,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-12-11 22:41:51,735 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 171 [2022-12-11 22:41:51,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 507 transitions, 6965 flow. Second operand has 24 states, 24 states have (on average 116.54166666666667) internal successors, (2797), 24 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:51,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:51,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 171 [2022-12-11 22:41:51,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:41:53,791 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][785], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 13#L59true, 168#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:53,792 INFO L382 tUnfolder$Statistics]: this new event has 129 ancestors and is cut-off event [2022-12-11 22:41:53,792 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:53,792 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:53,792 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:53,792 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][784], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 67#L58-5true, 168#true, 2611#true, 4440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:53,792 INFO L382 tUnfolder$Statistics]: this new event has 129 ancestors and is cut-off event [2022-12-11 22:41:53,793 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:53,793 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:53,793 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:53,844 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L77-->L79: Formula: (= (+ v_~csum~0_10 (select (select |v_#memory_int_31| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork0_~i~2_9 4)))) v_~csum~0_9) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_10} OutVars{~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_9, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_#t~mem5=|v_thread3Thread1of1ForFork0_#t~mem5_1|} AuxVars[] AssignedVars[~csum~0, thread3Thread1of1ForFork0_#t~mem5][833], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 153#L79true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 57#L58-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:53,844 INFO L382 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,844 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,844 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,844 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,848 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][785], [2618#true, thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 107#L77true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 13#L59true, 168#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:53,848 INFO L382 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,848 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,848 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,848 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,849 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][784], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 107#L77true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 67#L58-5true, 168#true, 2611#true, 4440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:53,849 INFO L382 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,849 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,849 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,849 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,850 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][839], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 13#L59true, 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:53,850 INFO L382 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,850 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,850 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,850 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,851 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][838], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 67#L58-5true, 168#true, 2611#true, 4440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:53,851 INFO L382 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,851 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,851 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,851 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,851 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][840], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 41#L73true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 57#L58-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:53,851 INFO L382 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,852 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,852 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,852 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:53,900 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][599], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 36#L51true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 57#L58-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:53,901 INFO L382 tUnfolder$Statistics]: this new event has 130 ancestors and is not cut-off event [2022-12-11 22:41:53,901 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is not cut-off event [2022-12-11 22:41:53,901 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is not cut-off event [2022-12-11 22:41:53,901 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is not cut-off event [2022-12-11 22:41:53,902 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][600], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 57#L58-4true, 69#L50-6true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:53,902 INFO L382 tUnfolder$Statistics]: this new event has 130 ancestors and is not cut-off event [2022-12-11 22:41:53,902 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is not cut-off event [2022-12-11 22:41:53,902 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is not cut-off event [2022-12-11 22:41:53,903 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is not cut-off event [2022-12-11 22:41:54,255 INFO L130 PetriNetUnfolder]: 6282/11096 cut-off events. [2022-12-11 22:41:54,255 INFO L131 PetriNetUnfolder]: For 101550/110348 co-relation queries the response was YES. [2022-12-11 22:41:54,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69005 conditions, 11096 events. 6282/11096 cut-off events. For 101550/110348 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 79568 event pairs, 646 based on Foata normal form. 490/10181 useless extension candidates. Maximal degree in co-relation 41835. Up to 6447 conditions per place. [2022-12-11 22:41:54,344 INFO L137 encePairwiseOnDemand]: 147/171 looper letters, 402 selfloop transitions, 42 changer transitions 389/955 dead transitions. [2022-12-11 22:41:54,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 955 transitions, 16212 flow [2022-12-11 22:41:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-11 22:41:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-11 22:41:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3080 transitions. [2022-12-11 22:41:54,352 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.692757534862798 [2022-12-11 22:41:54,352 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 72 predicate places. [2022-12-11 22:41:54,352 INFO L82 GeneralOperation]: Start removeDead. Operand has 224 places, 955 transitions, 16212 flow [2022-12-11 22:41:54,478 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 566 transitions, 8846 flow [2022-12-11 22:41:54,478 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 566 transitions, 8846 flow [2022-12-11 22:41:54,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 116.54166666666667) internal successors, (2797), 24 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:54,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:54,479 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:54,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-11 22:41:54,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:54,688 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:41:54,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:54,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1164051050, now seen corresponding path program 4 times [2022-12-11 22:41:54,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:54,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275555899] [2022-12-11 22:41:54,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:54,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-11 22:41:54,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:54,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275555899] [2022-12-11 22:41:54,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275555899] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:41:54,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683049526] [2022-12-11 22:41:54,936 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 22:41:54,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:54,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:41:54,938 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:41:54,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-11 22:41:55,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 22:41:55,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:41:55,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-11 22:41:55,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:41:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-11 22:41:55,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:41:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-11 22:41:55,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683049526] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:41:55,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:41:55,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-12-11 22:41:55,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904350159] [2022-12-11 22:41:55,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:41:55,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-11 22:41:55,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:55,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-11 22:41:55,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-12-11 22:41:55,572 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 171 [2022-12-11 22:41:55,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 566 transitions, 8846 flow. Second operand has 24 states, 24 states have (on average 115.79166666666667) internal successors, (2779), 24 states have internal predecessors, (2779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:55,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:55,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 171 [2022-12-11 22:41:55,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:41:56,796 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][234], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 69#L50-6true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 98#L58-2true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:56,796 INFO L382 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,796 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-11 22:41:56,797 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,797 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,797 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][235], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 36#L51true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 98#L58-2true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:56,797 INFO L382 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,797 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-11 22:41:56,797 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,797 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,856 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][232], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 36#L51true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 34#L58-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,856 INFO L382 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-12-11 22:41:56,856 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,857 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-11 22:41:56,857 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,857 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][233], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 69#L50-6true, 34#L58-3true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,857 INFO L382 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-12-11 22:41:56,857 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,857 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-11 22:41:56,857 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,857 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L77-->L79: Formula: (= (+ v_~csum~0_10 (select (select |v_#memory_int_31| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork0_~i~2_9 4)))) v_~csum~0_9) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_10} OutVars{~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_9, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_#t~mem5=|v_thread3Thread1of1ForFork0_#t~mem5_1|} AuxVars[] AssignedVars[~csum~0, thread3Thread1of1ForFork0_#t~mem5][438], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 153#L79true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 98#L58-2true, 168#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:56,857 INFO L382 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,857 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-11 22:41:56,857 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,857 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,858 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][439], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 41#L73true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 98#L58-2true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,858 INFO L382 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,858 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,858 INFO L385 tUnfolder$Statistics]: existing Event has 128 ancestors and is cut-off event [2022-12-11 22:41:56,858 INFO L385 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-12-11 22:41:56,929 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][232], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 36#L51true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 57#L58-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:56,930 INFO L382 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-12-11 22:41:56,930 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,930 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,930 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,930 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][233], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 69#L50-6true, 57#L58-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:56,930 INFO L382 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-12-11 22:41:56,930 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,930 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,930 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,930 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][375], [2618#true, thread1Thread1of1ForFork1InUse, 114#L75true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 67#L58-5true, 168#true, 2611#true, 4440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,931 INFO L382 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-12-11 22:41:56,931 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,931 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,931 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,931 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][376], [thread1Thread1of1ForFork1InUse, 2618#true, 114#L75true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 13#L59true, 168#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:56,931 INFO L382 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-12-11 22:41:56,931 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,931 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,931 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,933 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][375], [2618#true, thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 107#L77true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 67#L58-5true, 168#true, 2611#true, 4440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,933 INFO L382 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-12-11 22:41:56,933 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,933 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,933 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,933 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][376], [2618#true, thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 107#L77true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 13#L59true, 168#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:56,933 INFO L382 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-12-11 22:41:56,934 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,934 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,934 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,934 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L77-->L79: Formula: (= (+ v_~csum~0_10 (select (select |v_#memory_int_31| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork0_~i~2_9 4)))) v_~csum~0_9) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_10} OutVars{~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_9, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_#t~mem5=|v_thread3Thread1of1ForFork0_#t~mem5_1|} AuxVars[] AssignedVars[~csum~0, thread3Thread1of1ForFork0_#t~mem5][475], [2618#true, thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 153#L79true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,934 INFO L382 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-12-11 22:41:56,934 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,934 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-11 22:41:56,934 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,934 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L77-->L79: Formula: (= (+ v_~csum~0_10 (select (select |v_#memory_int_31| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork0_~i~2_9 4)))) v_~csum~0_9) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_10} OutVars{~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_9, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_#t~mem5=|v_thread3Thread1of1ForFork0_#t~mem5_1|} AuxVars[] AssignedVars[~csum~0, thread3Thread1of1ForFork0_#t~mem5][475], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 153#L79true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 57#L58-4true, 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,934 INFO L382 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-12-11 22:41:56,935 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,935 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,935 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,935 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][472], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 67#L58-5true, 168#true, 2611#true, 4440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,935 INFO L382 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-12-11 22:41:56,936 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,936 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,936 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,936 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][473], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 26#L76-1true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 13#L59true, 168#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:56,936 INFO L382 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-12-11 22:41:56,936 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,936 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,936 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,936 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][474], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 41#L73true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 34#L58-3true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,936 INFO L382 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-12-11 22:41:56,937 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,937 INFO L385 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-12-11 22:41:56,937 INFO L385 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-12-11 22:41:56,937 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][474], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 41#L73true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 57#L58-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,937 INFO L382 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-12-11 22:41:56,937 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,937 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,937 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,994 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([449] L77-->L79: Formula: (= (+ v_~csum~0_10 (select (select |v_#memory_int_31| v_~C~0.base_11) (+ v_~C~0.offset_11 (* v_thread3Thread1of1ForFork0_~i~2_9 4)))) v_~csum~0_9) InVars {~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_10} OutVars{~C~0.base=v_~C~0.base_11, ~csum~0=v_~csum~0_9, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_11, #memory_int=|v_#memory_int_31|, thread3Thread1of1ForFork0_#t~mem5=|v_thread3Thread1of1ForFork0_#t~mem5_1|} AuxVars[] AssignedVars[~csum~0, thread3Thread1of1ForFork0_#t~mem5][438], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 131#L64true, 259#(<= 1 ~N~0), 153#L79true, 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,994 INFO L382 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-12-11 22:41:56,994 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,994 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-11 22:41:56,994 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,995 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][439], [3147#(= (mod thread3Thread1of1ForFork0_~cond~0 256) 0), thread1Thread1of1ForFork1InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 41#L73true, 131#L64true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 5444#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0) (= thread3Thread1of1ForFork0_~i~2 0)), 10#L50-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 78#L97-4true, 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:56,995 INFO L382 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-12-11 22:41:56,995 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:56,995 INFO L385 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-12-11 22:41:56,995 INFO L385 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-12-11 22:41:57,626 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L76-1-->L72-2: Formula: (not (< v_thread3Thread1of1ForFork0_~i~2_5 v_~N~0_5)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_5, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][711], [130#L72-2true, thread1Thread1of1ForFork1InUse, 2618#true, 1793#(<= 1 ~N~0), thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 5430#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 57#L58-4true, 78#L97-4true, 168#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 2611#true]) [2022-12-11 22:41:57,626 INFO L382 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-12-11 22:41:57,626 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,626 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,626 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,627 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([441] L76-1-->L73: Formula: (< v_thread3Thread1of1ForFork0_~i~2_3 v_~N~0_6) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_3, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][712], [thread1Thread1of1ForFork1InUse, 2618#true, thread3Thread1of1ForFork0InUse, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 41#L73true, 259#(<= 1 ~N~0), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 57#L58-4true, 5452#(and (<= (+ thread3Thread1of1ForFork0_~i~2 1) ~N~0) (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0)), 78#L97-4true, 2610#(and (<= 1 ~N~0) (< thread3Thread1of1ForFork0_~i~2 ~N~0)), 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:57,627 INFO L382 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-12-11 22:41:57,627 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,627 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,627 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,627 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([430] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork2_~i~1_3 v_~N~0_4) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_3, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][275], [1793#(<= 1 ~N~0), 2618#true, thread1Thread1of1ForFork1InUse, 26#L76-1true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 259#(<= 1 ~N~0), 5430#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 1786#(and (<= 1 ~N~0) (< thread2Thread1of1ForFork2_~i~1 ~N~0)), 10#L50-4true, 78#L97-4true, 168#true, 13#L59true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:57,627 INFO L382 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-12-11 22:41:57,627 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,627 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,627 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,628 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L58-4-->L58-5: Formula: (not (< v_thread2Thread1of1ForFork2_~i~1_5 v_~N~0_3)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_5, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][276], [1793#(<= 1 ~N~0), 2618#true, thread1Thread1of1ForFork1InUse, 26#L76-1true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 5430#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 10#L50-4true, 78#L97-4true, 67#L58-5true, 168#true, 2611#true, 4440#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 thread2Thread1of1ForFork2_~i~1) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:57,628 INFO L382 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-12-11 22:41:57,628 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,628 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,628 INFO L385 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-12-11 22:41:57,644 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([418] L50-5-->L51: Formula: (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N~0_2) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[][124], [2618#true, 1793#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 26#L76-1true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 36#L51true, 998#(and (< thread1Thread1of1ForFork1_~i~0 ~N~0) (<= 1 ~N~0)), 5430#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 57#L58-4true, 78#L97-4true, 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:57,645 INFO L382 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-12-11 22:41:57,645 INFO L385 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-12-11 22:41:57,645 INFO L385 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-12-11 22:41:57,645 INFO L385 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-12-11 22:41:57,645 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L50-5-->L50-6: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_5 v_~N~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[][125], [2618#true, 1793#(<= 1 ~N~0), thread1Thread1of1ForFork1InUse, 26#L76-1true, 240#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 1005#(<= 1 ~N~0), 259#(<= 1 ~N~0), 5430#(and (<= |ULTIMATE.start_create_fresh_uint_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_uint_array_~i~3#1|) (<= |ULTIMATE.start_create_fresh_uint_array_#in~size#1| ~N~0) (<= 2 ~N~0)), 219#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 69#L50-6true, 57#L58-4true, 78#L97-4true, 168#true, 2611#true, 4391#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-12-11 22:41:57,645 INFO L382 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-12-11 22:41:57,645 INFO L385 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-12-11 22:41:57,645 INFO L385 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-12-11 22:41:57,645 INFO L385 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-12-11 22:41:57,776 INFO L130 PetriNetUnfolder]: 6558/10848 cut-off events. [2022-12-11 22:41:57,776 INFO L131 PetriNetUnfolder]: For 127452/136462 co-relation queries the response was YES. [2022-12-11 22:41:57,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76872 conditions, 10848 events. 6558/10848 cut-off events. For 127452/136462 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 71671 event pairs, 825 based on Foata normal form. 292/9178 useless extension candidates. Maximal degree in co-relation 70636. Up to 6705 conditions per place. [2022-12-11 22:41:57,869 INFO L137 encePairwiseOnDemand]: 152/171 looper letters, 606 selfloop transitions, 41 changer transitions 0/774 dead transitions. [2022-12-11 22:41:57,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 774 transitions, 14002 flow [2022-12-11 22:41:57,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-11 22:41:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-11 22:41:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2347 transitions. [2022-12-11 22:41:57,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6862573099415205 [2022-12-11 22:41:57,873 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 76 predicate places. [2022-12-11 22:41:57,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 774 transitions, 14002 flow [2022-12-11 22:41:57,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 774 transitions, 14002 flow [2022-12-11 22:41:57,955 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 774 transitions, 14002 flow [2022-12-11 22:41:57,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 115.79166666666667) internal successors, (2779), 24 states have internal predecessors, (2779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:57,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:41:57,957 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:41:57,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-11 22:41:58,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:58,158 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:41:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:41:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash 936141905, now seen corresponding path program 5 times [2022-12-11 22:41:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:41:58,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909003236] [2022-12-11 22:41:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:41:58,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:41:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:41:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-11 22:41:58,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:41:58,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909003236] [2022-12-11 22:41:58,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909003236] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:41:58,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241433307] [2022-12-11 22:41:58,395 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-11 22:41:58,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:41:58,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:41:58,397 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:41:58,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-11 22:41:58,485 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-11 22:41:58,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:41:58,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-11 22:41:58,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:41:58,623 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-11 22:41:58,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:41:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-11 22:41:58,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241433307] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:41:58,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:41:58,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-12-11 22:41:58,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621591718] [2022-12-11 22:41:58,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:41:58,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-11 22:41:58,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:41:58,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-11 22:41:58,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2022-12-11 22:41:58,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 171 [2022-12-11 22:41:58,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 774 transitions, 14002 flow. Second operand has 23 states, 23 states have (on average 105.30434782608695) internal successors, (2422), 23 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:41:58,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:41:58,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 171 [2022-12-11 22:41:58,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:42:11,503 INFO L130 PetriNetUnfolder]: 18345/28893 cut-off events. [2022-12-11 22:42:11,503 INFO L131 PetriNetUnfolder]: For 200632/206254 co-relation queries the response was YES. [2022-12-11 22:42:11,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201126 conditions, 28893 events. 18345/28893 cut-off events. For 200632/206254 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 191935 event pairs, 1138 based on Foata normal form. 52/26673 useless extension candidates. Maximal degree in co-relation 187197. Up to 14433 conditions per place. [2022-12-11 22:42:11,815 INFO L137 encePairwiseOnDemand]: 137/171 looper letters, 2738 selfloop transitions, 913 changer transitions 235/3970 dead transitions. [2022-12-11 22:42:11,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 3970 transitions, 71600 flow [2022-12-11 22:42:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-12-11 22:42:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2022-12-11 22:42:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 23037 transitions. [2022-12-11 22:42:11,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6295294310542712 [2022-12-11 22:42:11,845 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 289 predicate places. [2022-12-11 22:42:11,845 INFO L82 GeneralOperation]: Start removeDead. Operand has 441 places, 3970 transitions, 71600 flow [2022-12-11 22:42:12,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 441 places, 3735 transitions, 66196 flow [2022-12-11 22:42:12,051 INFO L495 AbstractCegarLoop]: Abstraction has has 441 places, 3735 transitions, 66196 flow [2022-12-11 22:42:12,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 105.30434782608695) internal successors, (2422), 23 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:42:12,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:42:12,052 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:42:12,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-11 22:42:12,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:42:12,260 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:42:12,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:42:12,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1907195549, now seen corresponding path program 6 times [2022-12-11 22:42:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:42:12,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768868713] [2022-12-11 22:42:12,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:42:12,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:42:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:42:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-11 22:42:12,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:42:12,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768868713] [2022-12-11 22:42:12,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768868713] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:42:12,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029838719] [2022-12-11 22:42:12,739 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-11 22:42:12,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:42:12,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:42:12,744 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:42:12,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-11 22:42:12,940 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-11 22:42:12,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:42:12,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-11 22:42:12,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:42:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-11 22:42:13,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:42:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-11 22:42:13,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029838719] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:42:13,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:42:13,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-12-11 22:42:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898910700] [2022-12-11 22:42:13,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:42:13,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-11 22:42:13,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:42:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-11 22:42:13,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-12-11 22:42:13,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 171 [2022-12-11 22:42:13,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 3735 transitions, 66196 flow. Second operand has 34 states, 34 states have (on average 115.94117647058823) internal successors, (3942), 34 states have internal predecessors, (3942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:42:13,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:42:13,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 171 [2022-12-11 22:42:13,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:42:34,888 INFO L130 PetriNetUnfolder]: 30451/47982 cut-off events. [2022-12-11 22:42:34,888 INFO L131 PetriNetUnfolder]: For 416589/431037 co-relation queries the response was YES. [2022-12-11 22:42:35,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353790 conditions, 47982 events. 30451/47982 cut-off events. For 416589/431037 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 338510 event pairs, 1198 based on Foata normal form. 886/46349 useless extension candidates. Maximal degree in co-relation 204311. Up to 24841 conditions per place. [2022-12-11 22:42:35,249 INFO L137 encePairwiseOnDemand]: 147/171 looper letters, 2635 selfloop transitions, 150 changer transitions 3008/6753 dead transitions. [2022-12-11 22:42:35,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 6753 transitions, 138832 flow [2022-12-11 22:42:35,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-11 22:42:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-11 22:42:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 5049 transitions. [2022-12-11 22:42:35,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6866585067319462 [2022-12-11 22:42:35,255 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 331 predicate places. [2022-12-11 22:42:35,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 483 places, 6753 transitions, 138832 flow [2022-12-11 22:42:35,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 454 places, 3745 transitions, 71942 flow [2022-12-11 22:42:35,466 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 3745 transitions, 71942 flow [2022-12-11 22:42:35,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 115.94117647058823) internal successors, (3942), 34 states have internal predecessors, (3942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:42:35,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:42:35,467 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:42:35,476 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-12-11 22:42:35,673 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,SelfDestructingSolverStorable11 [2022-12-11 22:42:35,673 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:42:35,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:42:35,674 INFO L85 PathProgramCache]: Analyzing trace with hash 615307708, now seen corresponding path program 7 times [2022-12-11 22:42:35,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:42:35,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145859994] [2022-12-11 22:42:35,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:42:35,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:42:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:42:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-12-11 22:42:36,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:42:36,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145859994] [2022-12-11 22:42:36,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145859994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:42:36,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038044616] [2022-12-11 22:42:36,030 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-11 22:42:36,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:42:36,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:42:36,031 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-12-11 22:42:36,033 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-12-11 22:42:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:42:36,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-11 22:42:36,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:42:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-12-11 22:42:36,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:42:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-12-11 22:42:36,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038044616] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:42:36,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:42:36,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-12-11 22:42:36,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276089498] [2022-12-11 22:42:36,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:42:36,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-11 22:42:36,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:42:36,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-11 22:42:36,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2022-12-11 22:42:36,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 171 [2022-12-11 22:42:36,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 3745 transitions, 71942 flow. Second operand has 34 states, 34 states have (on average 115.29411764705883) internal successors, (3920), 34 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:42:36,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:42:36,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 171 [2022-12-11 22:42:36,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:42:54,829 INFO L130 PetriNetUnfolder]: 27834/44213 cut-off events. [2022-12-11 22:42:54,829 INFO L131 PetriNetUnfolder]: For 470534/477300 co-relation queries the response was YES. [2022-12-11 22:42:55,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343346 conditions, 44213 events. 27834/44213 cut-off events. For 470534/477300 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 309513 event pairs, 1807 based on Foata normal form. 22/41632 useless extension candidates. Maximal degree in co-relation 341018. Up to 21808 conditions per place. [2022-12-11 22:42:55,294 INFO L137 encePairwiseOnDemand]: 152/171 looper letters, 3535 selfloop transitions, 475 changer transitions 0/5145 dead transitions. [2022-12-11 22:42:55,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 5145 transitions, 110472 flow [2022-12-11 22:42:55,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-11 22:42:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-11 22:42:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3283 transitions. [2022-12-11 22:42:55,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.685672514619883 [2022-12-11 22:42:55,298 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 329 predicate places. [2022-12-11 22:42:55,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 481 places, 5145 transitions, 110472 flow [2022-12-11 22:42:55,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 481 places, 5145 transitions, 110472 flow [2022-12-11 22:42:55,608 INFO L495 AbstractCegarLoop]: Abstraction has has 481 places, 5145 transitions, 110472 flow [2022-12-11 22:42:55,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 115.29411764705883) internal successors, (3920), 34 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:42:55,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:42:55,610 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:42:55,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-11 22:42:55,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-11 22:42:55,811 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:42:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:42:55,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1825339020, now seen corresponding path program 8 times [2022-12-11 22:42:55,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:42:55,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346197149] [2022-12-11 22:42:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:42:55,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:42:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:42:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-12-11 22:42:56,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:42:56,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346197149] [2022-12-11 22:42:56,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346197149] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:42:56,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172144860] [2022-12-11 22:42:56,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 22:42:56,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:42:56,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:42:56,337 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:42:56,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-11 22:42:56,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 22:42:56,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:42:56,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-11 22:42:56,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:42:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-12-11 22:42:56,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:42:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-12-11 22:42:57,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172144860] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:42:57,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:42:57,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-12-11 22:42:57,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778526577] [2022-12-11 22:42:57,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:42:57,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-11 22:42:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:42:57,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-11 22:42:57,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2022-12-11 22:42:57,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 171 [2022-12-11 22:42:57,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 5145 transitions, 110472 flow. Second operand has 34 states, 34 states have (on average 115.3529411764706) internal successors, (3922), 34 states have internal predecessors, (3922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:42:57,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:42:57,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 171 [2022-12-11 22:42:57,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:43:28,721 INFO L130 PetriNetUnfolder]: 31144/49256 cut-off events. [2022-12-11 22:43:28,722 INFO L131 PetriNetUnfolder]: For 624621/629797 co-relation queries the response was YES. [2022-12-11 22:43:28,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406115 conditions, 49256 events. 31144/49256 cut-off events. For 624621/629797 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 342628 event pairs, 2248 based on Foata normal form. 15/46171 useless extension candidates. Maximal degree in co-relation 388398. Up to 24448 conditions per place. [2022-12-11 22:43:29,255 INFO L137 encePairwiseOnDemand]: 152/171 looper letters, 3978 selfloop transitions, 179 changer transitions 0/5577 dead transitions. [2022-12-11 22:43:29,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 5577 transitions, 129992 flow [2022-12-11 22:43:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-11 22:43:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-11 22:43:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3279 transitions. [2022-12-11 22:43:29,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6848370927318296 [2022-12-11 22:43:29,258 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 356 predicate places. [2022-12-11 22:43:29,258 INFO L82 GeneralOperation]: Start removeDead. Operand has 508 places, 5577 transitions, 129992 flow [2022-12-11 22:43:29,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 508 places, 5577 transitions, 129992 flow [2022-12-11 22:43:29,620 INFO L495 AbstractCegarLoop]: Abstraction has has 508 places, 5577 transitions, 129992 flow [2022-12-11 22:43:29,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 115.3529411764706) internal successors, (3922), 34 states have internal predecessors, (3922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:43:29,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:43:29,621 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:43:29,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-11 22:43:29,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-11 22:43:29,822 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:43:29,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:43:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1799660837, now seen corresponding path program 9 times [2022-12-11 22:43:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:43:29,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809606412] [2022-12-11 22:43:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:43:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:43:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:43:30,221 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 37 proven. 24 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-11 22:43:30,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:43:30,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809606412] [2022-12-11 22:43:30,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809606412] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:43:30,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816671429] [2022-12-11 22:43:30,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 22:43:30,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:43:30,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:43:30,224 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:43:30,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-11 22:43:30,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-11 22:43:30,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:43:30,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-11 22:43:30,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:43:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-11 22:43:30,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:43:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-11 22:43:30,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816671429] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:43:30,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:43:30,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 21 [2022-12-11 22:43:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025935087] [2022-12-11 22:43:30,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:43:30,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-11 22:43:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:43:30,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-11 22:43:30,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2022-12-11 22:43:30,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 171 [2022-12-11 22:43:30,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 5577 transitions, 129992 flow. Second operand has 21 states, 21 states have (on average 132.1904761904762) internal successors, (2776), 21 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:43:30,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:43:30,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 171 [2022-12-11 22:43:30,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:44:57,014 INFO L130 PetriNetUnfolder]: 60499/95359 cut-off events. [2022-12-11 22:44:57,014 INFO L131 PetriNetUnfolder]: For 1056774/1064685 co-relation queries the response was YES. [2022-12-11 22:44:57,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850241 conditions, 95359 events. 60499/95359 cut-off events. For 1056774/1064685 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 721646 event pairs, 1728 based on Foata normal form. 86/88712 useless extension candidates. Maximal degree in co-relation 802002. Up to 47002 conditions per place. [2022-12-11 22:44:57,634 INFO L137 encePairwiseOnDemand]: 155/171 looper letters, 0 selfloop transitions, 0 changer transitions 14941/14941 dead transitions. [2022-12-11 22:44:57,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 14941 transitions, 386598 flow [2022-12-11 22:44:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2022-12-11 22:44:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2022-12-11 22:44:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 30214 transitions. [2022-12-11 22:44:57,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7887949039264829 [2022-12-11 22:44:57,656 INFO L295 CegarLoopForPetriNet]: 152 programPoint places, 568 predicate places. [2022-12-11 22:44:57,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 720 places, 14941 transitions, 386598 flow [2022-12-11 22:44:57,790 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-11 22:44:57,790 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-11 22:44:57,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 132.1904761904762) internal successors, (2776), 21 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:44:57,793 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-11 22:44:57,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-11 22:44:57,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-11 22:44:57,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-11 22:44:57,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-11 22:44:57,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-11 22:44:57,998 INFO L445 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1] [2022-12-11 22:44:58,003 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 22:44:58,003 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 22:44:58,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 10:44:58 BasicIcfg [2022-12-11 22:44:58,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 22:44:58,008 INFO L158 Benchmark]: Toolchain (without parser) took 199830.20ms. Allocated memory was 173.0MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 150.5MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-11 22:44:58,008 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 173.0MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 22:44:58,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.80ms. Allocated memory is still 173.0MB. Free memory was 150.1MB in the beginning and 137.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-11 22:44:58,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.95ms. Allocated memory is still 173.0MB. Free memory was 137.4MB in the beginning and 135.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 22:44:58,009 INFO L158 Benchmark]: Boogie Preprocessor took 35.01ms. Allocated memory is still 173.0MB. Free memory was 135.4MB in the beginning and 133.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 22:44:58,009 INFO L158 Benchmark]: RCFGBuilder took 502.24ms. Allocated memory is still 173.0MB. Free memory was 133.7MB in the beginning and 115.5MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-11 22:44:58,009 INFO L158 Benchmark]: TraceAbstraction took 198987.13ms. Allocated memory was 173.0MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 114.0MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-11 22:44:58,010 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 173.0MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.80ms. Allocated memory is still 173.0MB. Free memory was 150.1MB in the beginning and 137.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.95ms. Allocated memory is still 173.0MB. Free memory was 137.4MB in the beginning and 135.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.01ms. Allocated memory is still 173.0MB. Free memory was 135.4MB in the beginning and 133.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 502.24ms. Allocated memory is still 173.0MB. Free memory was 133.7MB in the beginning and 115.5MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 198987.13ms. Allocated memory was 173.0MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 114.0MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 103]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 191 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 1.6s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 198.8s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 183.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6999 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6999 mSDsluCounter, 2604 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2230 mSDsCounter, 305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12261 IncrementalHoareTripleChecker+Invalid, 12566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 305 mSolverCounterUnsat, 374 mSDtfsCounter, 12261 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4598 GetRequests, 3717 SyntacticMatches, 30 SemanticMatches, 851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50924 ImplicationChecksByTransitivity, 15.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129992occurred in iteration=14, InterpolantAutomatonStates: 664, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 467231 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 4046 NumberOfCodeBlocks, 3887 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 5789 ConstructedInterpolants, 0 QuantifiedInterpolants, 17441 SizeOfPredicates, 90 NumberOfNonLiveVariables, 3802 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 37 InterpolantComputations, 7 PerfectInterpolantSequences, 1042/1294 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-11 22:44:58,031 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 Received shutdown request...