./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:30:59,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:30:59,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:30:59,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:30:59,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:30:59,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:30:59,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:30:59,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:30:59,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:30:59,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:30:59,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:30:59,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:30:59,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:30:59,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:30:59,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:30:59,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:30:59,845 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:30:59,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:30:59,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:30:59,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:30:59,852 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:30:59,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:30:59,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:30:59,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:30:59,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:30:59,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:30:59,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:30:59,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:30:59,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:30:59,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:30:59,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:30:59,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:30:59,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:30:59,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:30:59,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:30:59,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:30:59,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:30:59,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:30:59,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:30:59,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:30:59,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:30:59,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:30:59,869 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:30:59,892 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:30:59,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:30:59,892 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:30:59,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:30:59,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:30:59,893 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:30:59,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:30:59,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:30:59,894 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:30:59,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:30:59,895 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:30:59,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:30:59,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:30:59,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:30:59,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:30:59,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:30:59,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:30:59,896 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:30:59,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:30:59,897 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:30:59,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:30:59,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:30:59,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:30:59,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:30:59,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:30:59,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:30:59,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:30:59,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:30:59,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:30:59,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:30:59,898 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:30:59,898 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:30:59,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:30:59,899 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2022-07-19 21:31:00,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:31:00,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:31:00,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:31:00,099 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:31:00,101 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:31:00,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2022-07-19 21:31:00,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98e62d80/565c7076e0164081bc251216873dcf50/FLAGbf5031544 [2022-07-19 21:31:00,544 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:31:00,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2022-07-19 21:31:00,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98e62d80/565c7076e0164081bc251216873dcf50/FLAGbf5031544 [2022-07-19 21:31:00,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98e62d80/565c7076e0164081bc251216873dcf50 [2022-07-19 21:31:00,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:31:00,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:31:00,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:31:00,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:31:00,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:31:00,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7e325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00, skipping insertion in model container [2022-07-19 21:31:00,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:31:00,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:31:00,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2022-07-19 21:31:00,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:31:00,742 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:31:00,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c[5161,5174] [2022-07-19 21:31:00,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:31:00,775 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:31:00,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00 WrapperNode [2022-07-19 21:31:00,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:31:00,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:31:00,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:31:00,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:31:00,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,807 INFO L137 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 336 [2022-07-19 21:31:00,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:31:00,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:31:00,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:31:00,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:31:00,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,842 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:31:00,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:31:00,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:31:00,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:31:00,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00" (1/1) ... [2022-07-19 21:31:00,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:31:00,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:00,883 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-07-19 21:31:00,888 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-07-19 21:31:00,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:31:00,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:31:00,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:31:00,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:31:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-19 21:31:00,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-19 21:31:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-19 21:31:00,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-19 21:31:00,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-19 21:31:00,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-19 21:31:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:31:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-19 21:31:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-19 21:31:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 21:31:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:31:00,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:31:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:31:00,912 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:31:00,982 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:31:00,983 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:31:01,339 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:31:01,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:31:01,459 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-19 21:31:01,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:31:01 BoogieIcfgContainer [2022-07-19 21:31:01,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:31:01,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:31:01,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:31:01,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:31:01,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:31:00" (1/3) ... [2022-07-19 21:31:01,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35420909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:31:01, skipping insertion in model container [2022-07-19 21:31:01,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:31:00" (2/3) ... [2022-07-19 21:31:01,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35420909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:31:01, skipping insertion in model container [2022-07-19 21:31:01,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:31:01" (3/3) ... [2022-07-19 21:31:01,468 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2022-07-19 21:31:01,472 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:31:01,478 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:31:01,478 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:31:01,492 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:31:01,561 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-19 21:31:01,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 256 places, 273 transitions, 570 flow [2022-07-19 21:31:01,665 INFO L129 PetriNetUnfolder]: 27/270 cut-off events. [2022-07-19 21:31:01,665 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-19 21:31:01,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 270 events. 27/270 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 172 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 229. Up to 6 conditions per place. [2022-07-19 21:31:01,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 273 transitions, 570 flow [2022-07-19 21:31:01,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 259 transitions, 536 flow [2022-07-19 21:31:01,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:31:01,687 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6510cd50, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8743ea9 [2022-07-19 21:31:01,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-19 21:31:01,730 INFO L129 PetriNetUnfolder]: 27/258 cut-off events. [2022-07-19 21:31:01,731 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-19 21:31:01,731 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:01,732 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:01,732 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-07-19 21:31:01,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:01,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1957594673, now seen corresponding path program 1 times [2022-07-19 21:31:01,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:01,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686713100] [2022-07-19 21:31:01,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:01,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:01,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:01,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686713100] [2022-07-19 21:31:01,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686713100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:01,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:01,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:31:01,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254185257] [2022-07-19 21:31:01,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:01,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 21:31:01,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:01,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 21:31:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 21:31:01,974 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 273 [2022-07-19 21:31:01,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 259 transitions, 536 flow. Second operand has 2 states, 2 states have (on average 250.0) internal successors, (500), 2 states have internal predecessors, (500), 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-07-19 21:31:01,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:01,983 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 273 [2022-07-19 21:31:01,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:02,068 INFO L129 PetriNetUnfolder]: 30/262 cut-off events. [2022-07-19 21:31:02,069 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-07-19 21:31:02,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 262 events. 30/262 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 177 event pairs, 0 based on Foata normal form. 19/259 useless extension candidates. Maximal degree in co-relation 234. Up to 31 conditions per place. [2022-07-19 21:31:02,073 INFO L132 encePairwiseOnDemand]: 260/273 looper letters, 14 selfloop transitions, 0 changer transitions 7/246 dead transitions. [2022-07-19 21:31:02,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 246 transitions, 538 flow [2022-07-19 21:31:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 21:31:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-19 21:31:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 517 transitions. [2022-07-19 21:31:02,087 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9468864468864469 [2022-07-19 21:31:02,088 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 517 transitions. [2022-07-19 21:31:02,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 517 transitions. [2022-07-19 21:31:02,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:02,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 517 transitions. [2022-07-19 21:31:02,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 258.5) internal successors, (517), 2 states have internal predecessors, (517), 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-07-19 21:31:02,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-07-19 21:31:02,103 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-07-19 21:31:02,104 INFO L186 Difference]: Start difference. First operand has 242 places, 259 transitions, 536 flow. Second operand 2 states and 517 transitions. [2022-07-19 21:31:02,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 246 transitions, 538 flow [2022-07-19 21:31:02,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 246 transitions, 526 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-19 21:31:02,121 INFO L242 Difference]: Finished difference. Result has 237 places, 239 transitions, 484 flow [2022-07-19 21:31:02,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=484, PETRI_PLACES=237, PETRI_TRANSITIONS=239} [2022-07-19 21:31:02,125 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, -5 predicate places. [2022-07-19 21:31:02,125 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 239 transitions, 484 flow [2022-07-19 21:31:02,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 250.0) internal successors, (500), 2 states have internal predecessors, (500), 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-07-19 21:31:02,126 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:02,126 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:02,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:31:02,127 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-07-19 21:31:02,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash -403629905, now seen corresponding path program 1 times [2022-07-19 21:31:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:02,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462508910] [2022-07-19 21:31:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:02,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462508910] [2022-07-19 21:31:02,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462508910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:02,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:02,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 21:31:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293894394] [2022-07-19 21:31:02,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:02,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:31:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:02,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:31:02,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:31:02,371 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 273 [2022-07-19 21:31:02,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 239 transitions, 484 flow. Second operand has 5 states, 5 states have (on average 215.2) internal successors, (1076), 5 states have internal predecessors, (1076), 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-07-19 21:31:02,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:02,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 273 [2022-07-19 21:31:02,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:02,503 INFO L129 PetriNetUnfolder]: 56/335 cut-off events. [2022-07-19 21:31:02,503 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-19 21:31:02,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 335 events. 56/335 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 461 event pairs, 0 based on Foata normal form. 1/309 useless extension candidates. Maximal degree in co-relation 432. Up to 47 conditions per place. [2022-07-19 21:31:02,506 INFO L132 encePairwiseOnDemand]: 265/273 looper letters, 51 selfloop transitions, 5 changer transitions 4/255 dead transitions. [2022-07-19 21:31:02,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 255 transitions, 641 flow [2022-07-19 21:31:02,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:31:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-19 21:31:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1101 transitions. [2022-07-19 21:31:02,510 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8065934065934066 [2022-07-19 21:31:02,510 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1101 transitions. [2022-07-19 21:31:02,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1101 transitions. [2022-07-19 21:31:02,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:02,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1101 transitions. [2022-07-19 21:31:02,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 220.2) internal successors, (1101), 5 states have internal predecessors, (1101), 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-07-19 21:31:02,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 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-07-19 21:31:02,515 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 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-07-19 21:31:02,522 INFO L186 Difference]: Start difference. First operand has 237 places, 239 transitions, 484 flow. Second operand 5 states and 1101 transitions. [2022-07-19 21:31:02,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 255 transitions, 641 flow [2022-07-19 21:31:02,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 255 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:31:02,532 INFO L242 Difference]: Finished difference. Result has 237 places, 243 transitions, 521 flow [2022-07-19 21:31:02,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=521, PETRI_PLACES=237, PETRI_TRANSITIONS=243} [2022-07-19 21:31:02,533 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, -5 predicate places. [2022-07-19 21:31:02,533 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 243 transitions, 521 flow [2022-07-19 21:31:02,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 215.2) internal successors, (1076), 5 states have internal predecessors, (1076), 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-07-19 21:31:02,534 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:02,534 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:02,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:31:02,535 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-07-19 21:31:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1856785592, now seen corresponding path program 1 times [2022-07-19 21:31:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:02,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349275804] [2022-07-19 21:31:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:02,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:02,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:02,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349275804] [2022-07-19 21:31:02,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349275804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:02,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:02,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:31:02,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86653499] [2022-07-19 21:31:02,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:02,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:31:02,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:02,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:31:02,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:31:02,754 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 273 [2022-07-19 21:31:02,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 243 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 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-07-19 21:31:02,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:02,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 273 [2022-07-19 21:31:02,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:02,842 INFO L129 PetriNetUnfolder]: 86/433 cut-off events. [2022-07-19 21:31:02,842 INFO L130 PetriNetUnfolder]: For 48/52 co-relation queries the response was YES. [2022-07-19 21:31:02,844 INFO L84 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 433 events. 86/433 cut-off events. For 48/52 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 908 event pairs, 2 based on Foata normal form. 10/395 useless extension candidates. Maximal degree in co-relation 593. Up to 64 conditions per place. [2022-07-19 21:31:02,846 INFO L132 encePairwiseOnDemand]: 264/273 looper letters, 30 selfloop transitions, 7 changer transitions 0/255 dead transitions. [2022-07-19 21:31:02,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 255 transitions, 633 flow [2022-07-19 21:31:02,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:31:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:31:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions. [2022-07-19 21:31:02,848 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9120879120879121 [2022-07-19 21:31:02,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 747 transitions. [2022-07-19 21:31:02,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 747 transitions. [2022-07-19 21:31:02,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:02,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 747 transitions. [2022-07-19 21:31:02,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-07-19 21:31:02,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:02,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:02,852 INFO L186 Difference]: Start difference. First operand has 237 places, 243 transitions, 521 flow. Second operand 3 states and 747 transitions. [2022-07-19 21:31:02,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 255 transitions, 633 flow [2022-07-19 21:31:02,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 255 transitions, 622 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-19 21:31:02,857 INFO L242 Difference]: Finished difference. Result has 235 places, 245 transitions, 549 flow [2022-07-19 21:31:02,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=235, PETRI_TRANSITIONS=245} [2022-07-19 21:31:02,859 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, -7 predicate places. [2022-07-19 21:31:02,859 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 245 transitions, 549 flow [2022-07-19 21:31:02,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 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-07-19 21:31:02,860 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:02,860 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:02,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 21:31:02,861 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-07-19 21:31:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash -472069804, now seen corresponding path program 1 times [2022-07-19 21:31:02,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:02,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385559466] [2022-07-19 21:31:02,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:02,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:03,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385559466] [2022-07-19 21:31:03,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385559466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:03,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:03,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 21:31:03,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816499888] [2022-07-19 21:31:03,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:03,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:31:03,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:03,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:31:03,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 21:31:03,009 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 273 [2022-07-19 21:31:03,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 245 transitions, 549 flow. Second operand has 4 states, 4 states have (on average 241.5) internal successors, (966), 4 states have internal predecessors, (966), 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-07-19 21:31:03,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:03,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 273 [2022-07-19 21:31:03,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:03,107 INFO L129 PetriNetUnfolder]: 147/636 cut-off events. [2022-07-19 21:31:03,107 INFO L130 PetriNetUnfolder]: For 152/156 co-relation queries the response was YES. [2022-07-19 21:31:03,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 636 events. 147/636 cut-off events. For 152/156 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2116 event pairs, 6 based on Foata normal form. 11/566 useless extension candidates. Maximal degree in co-relation 970. Up to 102 conditions per place. [2022-07-19 21:31:03,114 INFO L132 encePairwiseOnDemand]: 266/273 looper letters, 38 selfloop transitions, 6 changer transitions 0/262 dead transitions. [2022-07-19 21:31:03,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 262 transitions, 706 flow [2022-07-19 21:31:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 21:31:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-19 21:31:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 986 transitions. [2022-07-19 21:31:03,116 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2022-07-19 21:31:03,116 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 986 transitions. [2022-07-19 21:31:03,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 986 transitions. [2022-07-19 21:31:03,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:03,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 986 transitions. [2022-07-19 21:31:03,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 246.5) internal successors, (986), 4 states have internal predecessors, (986), 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-07-19 21:31:03,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 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-07-19 21:31:03,123 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 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-07-19 21:31:03,123 INFO L186 Difference]: Start difference. First operand has 235 places, 245 transitions, 549 flow. Second operand 4 states and 986 transitions. [2022-07-19 21:31:03,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 262 transitions, 706 flow [2022-07-19 21:31:03,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 262 transitions, 697 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:31:03,128 INFO L242 Difference]: Finished difference. Result has 238 places, 246 transitions, 564 flow [2022-07-19 21:31:03,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=564, PETRI_PLACES=238, PETRI_TRANSITIONS=246} [2022-07-19 21:31:03,133 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, -4 predicate places. [2022-07-19 21:31:03,134 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 246 transitions, 564 flow [2022-07-19 21:31:03,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 241.5) internal successors, (966), 4 states have internal predecessors, (966), 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-07-19 21:31:03,134 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:03,135 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:03,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 21:31:03,135 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-07-19 21:31:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1019934069, now seen corresponding path program 1 times [2022-07-19 21:31:03,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:03,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107398741] [2022-07-19 21:31:03,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:03,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:03,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:03,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107398741] [2022-07-19 21:31:03,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107398741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:03,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:03,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:31:03,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814636825] [2022-07-19 21:31:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:03,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:31:03,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:03,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:31:03,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:31:03,218 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 273 [2022-07-19 21:31:03,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 246 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-07-19 21:31:03,219 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:03,219 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 273 [2022-07-19 21:31:03,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:03,351 INFO L129 PetriNetUnfolder]: 315/1025 cut-off events. [2022-07-19 21:31:03,352 INFO L130 PetriNetUnfolder]: For 371/383 co-relation queries the response was YES. [2022-07-19 21:31:03,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 1025 events. 315/1025 cut-off events. For 371/383 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4767 event pairs, 42 based on Foata normal form. 3/861 useless extension candidates. Maximal degree in co-relation 1739. Up to 216 conditions per place. [2022-07-19 21:31:03,361 INFO L132 encePairwiseOnDemand]: 268/273 looper letters, 34 selfloop transitions, 6 changer transitions 0/260 dead transitions. [2022-07-19 21:31:03,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 260 transitions, 706 flow [2022-07-19 21:31:03,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:31:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:31:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2022-07-19 21:31:03,363 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2022-07-19 21:31:03,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 750 transitions. [2022-07-19 21:31:03,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 750 transitions. [2022-07-19 21:31:03,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:03,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 750 transitions. [2022-07-19 21:31:03,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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-07-19 21:31:03,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:03,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:03,367 INFO L186 Difference]: Start difference. First operand has 238 places, 246 transitions, 564 flow. Second operand 3 states and 750 transitions. [2022-07-19 21:31:03,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 260 transitions, 706 flow [2022-07-19 21:31:03,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 260 transitions, 695 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:31:03,372 INFO L242 Difference]: Finished difference. Result has 240 places, 247 transitions, 584 flow [2022-07-19 21:31:03,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=240, PETRI_TRANSITIONS=247} [2022-07-19 21:31:03,374 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, -2 predicate places. [2022-07-19 21:31:03,374 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 247 transitions, 584 flow [2022-07-19 21:31:03,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-07-19 21:31:03,375 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:03,375 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:03,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:31:03,376 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-07-19 21:31:03,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:03,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2132439207, now seen corresponding path program 1 times [2022-07-19 21:31:03,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:03,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106271011] [2022-07-19 21:31:03,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:03,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:03,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:03,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106271011] [2022-07-19 21:31:03,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106271011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:03,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:03,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:31:03,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559209497] [2022-07-19 21:31:03,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:03,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:31:03,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:03,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:31:03,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:31:03,446 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 273 [2022-07-19 21:31:03,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 247 transitions, 584 flow. Second operand has 6 states, 6 states have (on average 212.66666666666666) internal successors, (1276), 6 states have internal predecessors, (1276), 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-07-19 21:31:03,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:03,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 273 [2022-07-19 21:31:03,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:03,675 INFO L129 PetriNetUnfolder]: 199/1019 cut-off events. [2022-07-19 21:31:03,676 INFO L130 PetriNetUnfolder]: For 555/599 co-relation queries the response was YES. [2022-07-19 21:31:03,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1649 conditions, 1019 events. 199/1019 cut-off events. For 555/599 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4410 event pairs, 25 based on Foata normal form. 18/897 useless extension candidates. Maximal degree in co-relation 1641. Up to 222 conditions per place. [2022-07-19 21:31:03,687 INFO L132 encePairwiseOnDemand]: 262/273 looper letters, 88 selfloop transitions, 11 changer transitions 0/287 dead transitions. [2022-07-19 21:31:03,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 287 transitions, 880 flow [2022-07-19 21:31:03,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:31:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:31:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1955 transitions. [2022-07-19 21:31:03,691 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7956857956857957 [2022-07-19 21:31:03,692 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1955 transitions. [2022-07-19 21:31:03,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1955 transitions. [2022-07-19 21:31:03,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:03,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1955 transitions. [2022-07-19 21:31:03,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 217.22222222222223) internal successors, (1955), 9 states have internal predecessors, (1955), 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-07-19 21:31:03,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 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-07-19 21:31:03,701 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 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-07-19 21:31:03,702 INFO L186 Difference]: Start difference. First operand has 240 places, 247 transitions, 584 flow. Second operand 9 states and 1955 transitions. [2022-07-19 21:31:03,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 287 transitions, 880 flow [2022-07-19 21:31:03,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 287 transitions, 868 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:31:03,709 INFO L242 Difference]: Finished difference. Result has 248 places, 251 transitions, 616 flow [2022-07-19 21:31:03,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=616, PETRI_PLACES=248, PETRI_TRANSITIONS=251} [2022-07-19 21:31:03,711 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 6 predicate places. [2022-07-19 21:31:03,712 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 251 transitions, 616 flow [2022-07-19 21:31:03,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 212.66666666666666) internal successors, (1276), 6 states have internal predecessors, (1276), 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-07-19 21:31:03,712 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:03,713 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:03,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:31:03,713 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-07-19 21:31:03,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:03,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1323365446, now seen corresponding path program 1 times [2022-07-19 21:31:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:03,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106741090] [2022-07-19 21:31:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:31:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106741090] [2022-07-19 21:31:03,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106741090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:03,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:03,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:31:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97990281] [2022-07-19 21:31:03,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:03,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:31:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:03,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:31:03,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:31:03,770 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 273 [2022-07-19 21:31:03,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 251 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-07-19 21:31:03,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:03,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 273 [2022-07-19 21:31:03,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:03,909 INFO L129 PetriNetUnfolder]: 265/981 cut-off events. [2022-07-19 21:31:03,909 INFO L130 PetriNetUnfolder]: For 526/589 co-relation queries the response was YES. [2022-07-19 21:31:03,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 981 events. 265/981 cut-off events. For 526/589 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3487 event pairs, 19 based on Foata normal form. 2/891 useless extension candidates. Maximal degree in co-relation 1779. Up to 213 conditions per place. [2022-07-19 21:31:03,915 INFO L132 encePairwiseOnDemand]: 268/273 looper letters, 32 selfloop transitions, 5 changer transitions 3/258 dead transitions. [2022-07-19 21:31:03,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 258 transitions, 714 flow [2022-07-19 21:31:03,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:31:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:31:03,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 741 transitions. [2022-07-19 21:31:03,917 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2022-07-19 21:31:03,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 741 transitions. [2022-07-19 21:31:03,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 741 transitions. [2022-07-19 21:31:03,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:03,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 741 transitions. [2022-07-19 21:31:03,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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-07-19 21:31:03,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:03,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:03,921 INFO L186 Difference]: Start difference. First operand has 248 places, 251 transitions, 616 flow. Second operand 3 states and 741 transitions. [2022-07-19 21:31:03,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 258 transitions, 714 flow [2022-07-19 21:31:03,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 258 transitions, 705 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-19 21:31:03,925 INFO L242 Difference]: Finished difference. Result has 249 places, 247 transitions, 608 flow [2022-07-19 21:31:03,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=249, PETRI_TRANSITIONS=247} [2022-07-19 21:31:03,926 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 7 predicate places. [2022-07-19 21:31:03,926 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 247 transitions, 608 flow [2022-07-19 21:31:03,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-07-19 21:31:03,926 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:03,927 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:03,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 21:31:03,927 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-07-19 21:31:03,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:03,927 INFO L85 PathProgramCache]: Analyzing trace with hash 21386580, now seen corresponding path program 1 times [2022-07-19 21:31:03,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:03,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047015773] [2022-07-19 21:31:03,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:04,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:04,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047015773] [2022-07-19 21:31:04,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047015773] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:04,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940640686] [2022-07-19 21:31:04,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:04,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:04,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:04,378 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-07-19 21:31:04,399 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-07-19 21:31:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:04,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-19 21:31:04,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:05,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 21:31:05,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:31:05,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:31:05,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:31:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:06,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:07,168 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:31:07,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-07-19 21:31:07,178 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-19 21:31:07,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 398 treesize of output 373 [2022-07-19 21:31:07,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:31:07,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 135 [2022-07-19 21:31:07,194 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:31:07,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 222 [2022-07-19 21:31:07,201 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:31:07,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 198 [2022-07-19 21:31:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:07,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940640686] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:07,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:07,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24, 20] total 54 [2022-07-19 21:31:07,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337262403] [2022-07-19 21:31:07,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:07,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-19 21:31:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:07,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-19 21:31:07,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=2336, Unknown=63, NotChecked=0, Total=2862 [2022-07-19 21:31:07,622 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 273 [2022-07-19 21:31:07,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 247 transitions, 608 flow. Second operand has 54 states, 54 states have (on average 134.96296296296296) internal successors, (7288), 54 states have internal predecessors, (7288), 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-07-19 21:31:07,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:07,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 273 [2022-07-19 21:31:07,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:09,685 INFO L129 PetriNetUnfolder]: 410/1555 cut-off events. [2022-07-19 21:31:09,686 INFO L130 PetriNetUnfolder]: For 1016/1120 co-relation queries the response was YES. [2022-07-19 21:31:09,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3110 conditions, 1555 events. 410/1555 cut-off events. For 1016/1120 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8156 event pairs, 0 based on Foata normal form. 8/1392 useless extension candidates. Maximal degree in co-relation 3099. Up to 341 conditions per place. [2022-07-19 21:31:09,698 INFO L132 encePairwiseOnDemand]: 237/273 looper letters, 190 selfloop transitions, 48 changer transitions 8/371 dead transitions. [2022-07-19 21:31:09,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 371 transitions, 1457 flow [2022-07-19 21:31:09,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 21:31:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-19 21:31:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4143 transitions. [2022-07-19 21:31:09,706 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5058608058608058 [2022-07-19 21:31:09,706 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4143 transitions. [2022-07-19 21:31:09,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4143 transitions. [2022-07-19 21:31:09,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:09,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4143 transitions. [2022-07-19 21:31:09,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 138.1) internal successors, (4143), 30 states have internal predecessors, (4143), 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-07-19 21:31:09,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 273.0) internal successors, (8463), 31 states have internal predecessors, (8463), 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-07-19 21:31:09,723 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 273.0) internal successors, (8463), 31 states have internal predecessors, (8463), 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-07-19 21:31:09,723 INFO L186 Difference]: Start difference. First operand has 249 places, 247 transitions, 608 flow. Second operand 30 states and 4143 transitions. [2022-07-19 21:31:09,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 371 transitions, 1457 flow [2022-07-19 21:31:09,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 371 transitions, 1430 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-19 21:31:09,730 INFO L242 Difference]: Finished difference. Result has 285 places, 277 transitions, 915 flow [2022-07-19 21:31:09,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=915, PETRI_PLACES=285, PETRI_TRANSITIONS=277} [2022-07-19 21:31:09,731 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 43 predicate places. [2022-07-19 21:31:09,731 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 277 transitions, 915 flow [2022-07-19 21:31:09,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 134.96296296296296) internal successors, (7288), 54 states have internal predecessors, (7288), 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-07-19 21:31:09,733 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:09,734 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:09,753 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-07-19 21:31:09,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:09,952 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-07-19 21:31:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash -151088598, now seen corresponding path program 2 times [2022-07-19 21:31:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:09,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324784720] [2022-07-19 21:31:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:09,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:10,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:10,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324784720] [2022-07-19 21:31:10,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324784720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:10,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022204494] [2022-07-19 21:31:10,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:31:10,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:10,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:10,420 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-07-19 21:31:10,421 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-07-19 21:31:10,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:31:10,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:10,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-19 21:31:10,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:10,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 21:31:11,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:31:11,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:31:11,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:31:11,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:11,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:12,957 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:31:12,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-07-19 21:31:12,965 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-19 21:31:12,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 398 treesize of output 373 [2022-07-19 21:31:12,973 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:31:12,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 366 treesize of output 270 [2022-07-19 21:31:12,980 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:31:12,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 222 [2022-07-19 21:31:12,988 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:31:12,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 198 [2022-07-19 21:31:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:31:13,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022204494] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:13,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:13,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 20] total 55 [2022-07-19 21:31:13,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513110366] [2022-07-19 21:31:13,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:13,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-19 21:31:13,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:13,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-19 21:31:13,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=2442, Unknown=62, NotChecked=0, Total=2970 [2022-07-19 21:31:13,389 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 273 [2022-07-19 21:31:13,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 277 transitions, 915 flow. Second operand has 55 states, 55 states have (on average 134.87272727272727) internal successors, (7418), 55 states have internal predecessors, (7418), 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-07-19 21:31:13,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:13,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 273 [2022-07-19 21:31:13,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:15,749 INFO L129 PetriNetUnfolder]: 755/2615 cut-off events. [2022-07-19 21:31:15,750 INFO L130 PetriNetUnfolder]: For 4117/4340 co-relation queries the response was YES. [2022-07-19 21:31:15,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6463 conditions, 2615 events. 755/2615 cut-off events. For 4117/4340 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 17537 event pairs, 0 based on Foata normal form. 39/2302 useless extension candidates. Maximal degree in co-relation 6439. Up to 485 conditions per place. [2022-07-19 21:31:15,777 INFO L132 encePairwiseOnDemand]: 231/273 looper letters, 228 selfloop transitions, 80 changer transitions 9/442 dead transitions. [2022-07-19 21:31:15,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 442 transitions, 2267 flow [2022-07-19 21:31:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-19 21:31:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-07-19 21:31:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5245 transitions. [2022-07-19 21:31:15,790 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5055909003277425 [2022-07-19 21:31:15,790 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5245 transitions. [2022-07-19 21:31:15,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5245 transitions. [2022-07-19 21:31:15,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:15,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5245 transitions. [2022-07-19 21:31:15,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 138.02631578947367) internal successors, (5245), 38 states have internal predecessors, (5245), 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-07-19 21:31:15,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 273.0) internal successors, (10647), 39 states have internal predecessors, (10647), 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-07-19 21:31:15,813 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 273.0) internal successors, (10647), 39 states have internal predecessors, (10647), 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-07-19 21:31:15,813 INFO L186 Difference]: Start difference. First operand has 285 places, 277 transitions, 915 flow. Second operand 38 states and 5245 transitions. [2022-07-19 21:31:15,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 442 transitions, 2267 flow [2022-07-19 21:31:15,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 442 transitions, 2183 flow, removed 19 selfloop flow, removed 14 redundant places. [2022-07-19 21:31:15,823 INFO L242 Difference]: Finished difference. Result has 312 places, 308 transitions, 1345 flow [2022-07-19 21:31:15,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=1345, PETRI_PLACES=312, PETRI_TRANSITIONS=308} [2022-07-19 21:31:15,824 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 70 predicate places. [2022-07-19 21:31:15,824 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 308 transitions, 1345 flow [2022-07-19 21:31:15,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 134.87272727272727) internal successors, (7418), 55 states have internal predecessors, (7418), 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-07-19 21:31:15,826 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:15,826 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:15,847 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-07-19 21:31:16,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-19 21:31:16,040 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-07-19 21:31:16,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:16,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1746161682, now seen corresponding path program 1 times [2022-07-19 21:31:16,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:16,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752588457] [2022-07-19 21:31:16,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:16,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 21:31:16,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:16,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752588457] [2022-07-19 21:31:16,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752588457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:16,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:16,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:31:16,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389209036] [2022-07-19 21:31:16,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:16,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:31:16,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:16,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:31:16,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:31:16,087 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 273 [2022-07-19 21:31:16,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 308 transitions, 1345 flow. Second operand has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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-07-19 21:31:16,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:16,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 273 [2022-07-19 21:31:16,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:16,387 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][279], [18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 158#L73-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 68#L95-1true, Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 2989#true, Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2979#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2981#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 311#(= ~manager_state~0 0), 13#L157-1true]) [2022-07-19 21:31:16,389 INFO L384 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-07-19 21:31:16,390 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-07-19 21:31:16,390 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2022-07-19 21:31:16,390 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-07-19 21:31:16,418 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][279], [18#L117-1true, 259#true, 56#L95true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 158#L73-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 2989#true, Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2979#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2981#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 311#(= ~manager_state~0 0), 13#L157-1true]) [2022-07-19 21:31:16,419 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-07-19 21:31:16,419 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-07-19 21:31:16,419 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-07-19 21:31:16,419 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2022-07-19 21:31:16,420 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][279], [18#L117-1true, 259#true, 153#L96true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 158#L73-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 2989#true, Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2979#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2981#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 311#(= ~manager_state~0 0), 13#L157-1true]) [2022-07-19 21:31:16,420 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-07-19 21:31:16,421 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-07-19 21:31:16,421 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-07-19 21:31:16,421 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2022-07-19 21:31:16,427 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][279], [18#L117-1true, 259#true, 158#L73-1true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 68#L95-1true, Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 2989#true, Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2979#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2981#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 309#true, 13#L157-1true]) [2022-07-19 21:31:16,427 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-07-19 21:31:16,427 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-07-19 21:31:16,427 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-07-19 21:31:16,427 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-07-19 21:31:16,448 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][279], [18#L117-1true, 56#L95true, 259#true, 158#L73-1true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 2989#true, Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2979#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2981#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 309#true, 13#L157-1true]) [2022-07-19 21:31:16,449 INFO L384 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-07-19 21:31:16,449 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-07-19 21:31:16,449 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-07-19 21:31:16,449 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2022-07-19 21:31:16,456 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][279], [18#L117-1true, 259#true, 153#L96true, 158#L73-1true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 2989#true, Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2979#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2981#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 309#true, 13#L157-1true]) [2022-07-19 21:31:16,457 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-07-19 21:31:16,457 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-07-19 21:31:16,457 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-07-19 21:31:16,457 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-07-19 21:31:16,496 INFO L129 PetriNetUnfolder]: 1022/3099 cut-off events. [2022-07-19 21:31:16,497 INFO L130 PetriNetUnfolder]: For 12199/12880 co-relation queries the response was YES. [2022-07-19 21:31:16,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9648 conditions, 3099 events. 1022/3099 cut-off events. For 12199/12880 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 21781 event pairs, 147 based on Foata normal form. 19/2616 useless extension candidates. Maximal degree in co-relation 9621. Up to 914 conditions per place. [2022-07-19 21:31:16,522 INFO L132 encePairwiseOnDemand]: 268/273 looper letters, 62 selfloop transitions, 6 changer transitions 0/307 dead transitions. [2022-07-19 21:31:16,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 307 transitions, 1453 flow [2022-07-19 21:31:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:31:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:31:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2022-07-19 21:31:16,524 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2022-07-19 21:31:16,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 750 transitions. [2022-07-19 21:31:16,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 750 transitions. [2022-07-19 21:31:16,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:16,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 750 transitions. [2022-07-19 21:31:16,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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-07-19 21:31:16,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:16,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:16,528 INFO L186 Difference]: Start difference. First operand has 312 places, 308 transitions, 1345 flow. Second operand 3 states and 750 transitions. [2022-07-19 21:31:16,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 307 transitions, 1453 flow [2022-07-19 21:31:16,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 307 transitions, 1311 flow, removed 33 selfloop flow, removed 30 redundant places. [2022-07-19 21:31:16,539 INFO L242 Difference]: Finished difference. Result has 284 places, 298 transitions, 1122 flow [2022-07-19 21:31:16,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1122, PETRI_PLACES=284, PETRI_TRANSITIONS=298} [2022-07-19 21:31:16,541 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 42 predicate places. [2022-07-19 21:31:16,541 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 298 transitions, 1122 flow [2022-07-19 21:31:16,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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-07-19 21:31:16,541 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:16,541 INFO L200 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:16,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 21:31:16,542 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-07-19 21:31:16,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:16,542 INFO L85 PathProgramCache]: Analyzing trace with hash 242017493, now seen corresponding path program 1 times [2022-07-19 21:31:16,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:16,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874365787] [2022-07-19 21:31:16,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:16,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:31:16,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:16,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874365787] [2022-07-19 21:31:16,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874365787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:16,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:16,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:31:16,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375889161] [2022-07-19 21:31:16,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:16,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:31:16,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:16,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:31:16,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:31:16,599 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 273 [2022-07-19 21:31:16,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 298 transitions, 1122 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-07-19 21:31:16,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:16,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 273 [2022-07-19 21:31:16,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:16,764 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][260], [2995#true, 18#L117-1true, 2991#(= ~node_state~0 0), 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 158#L73-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 282#(<= ~node_back~0 ~node_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0)]) [2022-07-19 21:31:16,764 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-07-19 21:31:16,764 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-07-19 21:31:16,765 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2022-07-19 21:31:16,765 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-07-19 21:31:16,790 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][260], [2995#true, 18#L117-1true, 2991#(= ~node_state~0 0), 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 158#L73-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 68#L95-1true, Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 13#L157-1true, Black: 311#(= ~manager_state~0 0)]) [2022-07-19 21:31:16,791 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-07-19 21:31:16,791 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-07-19 21:31:16,791 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-07-19 21:31:16,791 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2022-07-19 21:31:16,828 INFO L129 PetriNetUnfolder]: 447/1803 cut-off events. [2022-07-19 21:31:16,828 INFO L130 PetriNetUnfolder]: For 6093/6436 co-relation queries the response was YES. [2022-07-19 21:31:16,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5069 conditions, 1803 events. 447/1803 cut-off events. For 6093/6436 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10336 event pairs, 26 based on Foata normal form. 59/1626 useless extension candidates. Maximal degree in co-relation 5043. Up to 353 conditions per place. [2022-07-19 21:31:16,844 INFO L132 encePairwiseOnDemand]: 270/273 looper letters, 60 selfloop transitions, 4 changer transitions 0/305 dead transitions. [2022-07-19 21:31:16,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 305 transitions, 1327 flow [2022-07-19 21:31:16,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:31:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:31:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2022-07-19 21:31:16,848 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9181929181929182 [2022-07-19 21:31:16,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2022-07-19 21:31:16,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2022-07-19 21:31:16,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:16,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2022-07-19 21:31:16,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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-07-19 21:31:16,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:16,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:16,851 INFO L186 Difference]: Start difference. First operand has 284 places, 298 transitions, 1122 flow. Second operand 3 states and 752 transitions. [2022-07-19 21:31:16,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 305 transitions, 1327 flow [2022-07-19 21:31:16,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 305 transitions, 1307 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:31:16,859 INFO L242 Difference]: Finished difference. Result has 283 places, 291 transitions, 1060 flow [2022-07-19 21:31:16,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=283, PETRI_TRANSITIONS=291} [2022-07-19 21:31:16,860 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 41 predicate places. [2022-07-19 21:31:16,860 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 291 transitions, 1060 flow [2022-07-19 21:31:16,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-07-19 21:31:16,861 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:16,861 INFO L200 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:16,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 21:31:16,861 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-07-19 21:31:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash -872769379, now seen corresponding path program 3 times [2022-07-19 21:31:16,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:16,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073078819] [2022-07-19 21:31:16,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:16,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:31:16,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:16,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073078819] [2022-07-19 21:31:16,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073078819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:16,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:16,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:31:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164983982] [2022-07-19 21:31:16,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:16,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:31:16,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:16,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:31:16,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:31:16,898 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 273 [2022-07-19 21:31:16,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 291 transitions, 1060 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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-07-19 21:31:16,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:16,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 273 [2022-07-19 21:31:16,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:17,094 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#L53true, Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 309#true, 13#L157-1true]) [2022-07-19 21:31:17,094 INFO L384 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-07-19 21:31:17,094 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-07-19 21:31:17,095 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-07-19 21:31:17,095 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-07-19 21:31:17,131 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 158#L73-1true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 311#(= ~manager_state~0 0), 13#L157-1true]) [2022-07-19 21:31:17,131 INFO L384 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-07-19 21:31:17,131 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-07-19 21:31:17,131 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-07-19 21:31:17,131 INFO L387 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-07-19 21:31:17,145 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), 162#L59true, Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 311#(= ~manager_state~0 0), 13#L157-1true]) [2022-07-19 21:31:17,146 INFO L384 tUnfolder$Statistics]: this new event has 209 ancestors and is cut-off event [2022-07-19 21:31:17,146 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-07-19 21:31:17,146 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-07-19 21:31:17,146 INFO L387 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-07-19 21:31:17,151 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 311#(= ~manager_state~0 0), 13#L157-1true, 55#L66true]) [2022-07-19 21:31:17,152 INFO L384 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-07-19 21:31:17,152 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-07-19 21:31:17,152 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-07-19 21:31:17,152 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-19 21:31:17,153 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 158#L73-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2991#(= ~node_state~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0)]) [2022-07-19 21:31:17,153 INFO L384 tUnfolder$Statistics]: this new event has 210 ancestors and is cut-off event [2022-07-19 21:31:17,154 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-19 21:31:17,154 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-07-19 21:31:17,154 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-07-19 21:31:17,157 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 311#(= ~manager_state~0 0), 13#L157-1true, 178#L67true]) [2022-07-19 21:31:17,157 INFO L384 tUnfolder$Statistics]: this new event has 211 ancestors and is cut-off event [2022-07-19 21:31:17,157 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-07-19 21:31:17,157 INFO L387 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-07-19 21:31:17,157 INFO L387 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-07-19 21:31:17,158 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), 29#L73true, Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 311#(= ~manager_state~0 0), 13#L157-1true]) [2022-07-19 21:31:17,158 INFO L384 tUnfolder$Statistics]: this new event has 211 ancestors and is cut-off event [2022-07-19 21:31:17,158 INFO L387 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-07-19 21:31:17,158 INFO L387 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-07-19 21:31:17,158 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-07-19 21:31:17,161 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 239#L74true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 311#(= ~manager_state~0 0), 13#L157-1true]) [2022-07-19 21:31:17,162 INFO L384 tUnfolder$Statistics]: this new event has 212 ancestors and is cut-off event [2022-07-19 21:31:17,162 INFO L387 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-07-19 21:31:17,162 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-07-19 21:31:17,162 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-07-19 21:31:17,164 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), 162#L59true, Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2991#(= ~node_state~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0)]) [2022-07-19 21:31:17,165 INFO L384 tUnfolder$Statistics]: this new event has 213 ancestors and is cut-off event [2022-07-19 21:31:17,165 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-07-19 21:31:17,165 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-07-19 21:31:17,165 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-07-19 21:31:17,174 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2991#(= ~node_state~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0), 55#L66true]) [2022-07-19 21:31:17,174 INFO L384 tUnfolder$Statistics]: this new event has 214 ancestors and is cut-off event [2022-07-19 21:31:17,174 INFO L387 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-07-19 21:31:17,175 INFO L387 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-07-19 21:31:17,175 INFO L387 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-07-19 21:31:17,178 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2991#(= ~node_state~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0), 178#L67true]) [2022-07-19 21:31:17,178 INFO L384 tUnfolder$Statistics]: this new event has 215 ancestors and is cut-off event [2022-07-19 21:31:17,178 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-19 21:31:17,178 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-19 21:31:17,178 INFO L387 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-07-19 21:31:17,179 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), 29#L73true, Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2991#(= ~node_state~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0)]) [2022-07-19 21:31:17,179 INFO L384 tUnfolder$Statistics]: this new event has 215 ancestors and is cut-off event [2022-07-19 21:31:17,179 INFO L387 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-07-19 21:31:17,179 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-19 21:31:17,179 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-19 21:31:17,181 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][226], [2995#true, 18#L117-1true, 259#true, 239#L74true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2991#(= ~node_state~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0)]) [2022-07-19 21:31:17,181 INFO L384 tUnfolder$Statistics]: this new event has 216 ancestors and is cut-off event [2022-07-19 21:31:17,181 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-07-19 21:31:17,182 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-07-19 21:31:17,182 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-07-19 21:31:17,191 INFO L129 PetriNetUnfolder]: 896/2458 cut-off events. [2022-07-19 21:31:17,191 INFO L130 PetriNetUnfolder]: For 14237/15007 co-relation queries the response was YES. [2022-07-19 21:31:17,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8900 conditions, 2458 events. 896/2458 cut-off events. For 14237/15007 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 13730 event pairs, 77 based on Foata normal form. 1/2067 useless extension candidates. Maximal degree in co-relation 8873. Up to 839 conditions per place. [2022-07-19 21:31:17,219 INFO L132 encePairwiseOnDemand]: 268/273 looper letters, 47 selfloop transitions, 11 changer transitions 0/292 dead transitions. [2022-07-19 21:31:17,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 292 transitions, 1204 flow [2022-07-19 21:31:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:31:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:31:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2022-07-19 21:31:17,220 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.905982905982906 [2022-07-19 21:31:17,220 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 742 transitions. [2022-07-19 21:31:17,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 742 transitions. [2022-07-19 21:31:17,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:17,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 742 transitions. [2022-07-19 21:31:17,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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-07-19 21:31:17,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:17,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:17,223 INFO L186 Difference]: Start difference. First operand has 283 places, 291 transitions, 1060 flow. Second operand 3 states and 742 transitions. [2022-07-19 21:31:17,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 292 transitions, 1204 flow [2022-07-19 21:31:17,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 292 transitions, 1202 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:31:17,232 INFO L242 Difference]: Finished difference. Result has 285 places, 282 transitions, 1035 flow [2022-07-19 21:31:17,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1035, PETRI_PLACES=285, PETRI_TRANSITIONS=282} [2022-07-19 21:31:17,233 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 43 predicate places. [2022-07-19 21:31:17,233 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 282 transitions, 1035 flow [2022-07-19 21:31:17,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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-07-19 21:31:17,233 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:17,234 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:17,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 21:31:17,234 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-07-19 21:31:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash 506223541, now seen corresponding path program 1 times [2022-07-19 21:31:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:17,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020643174] [2022-07-19 21:31:17,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 21:31:17,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:17,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020643174] [2022-07-19 21:31:17,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020643174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:17,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:17,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:31:17,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183999352] [2022-07-19 21:31:17,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:17,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:31:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:17,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:31:17,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:31:17,280 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 273 [2022-07-19 21:31:17,281 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 282 transitions, 1035 flow. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-07-19 21:31:17,281 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:17,281 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 273 [2022-07-19 21:31:17,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:17,508 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][239], [18#L117-1true, 259#true, 158#L73-1true, 3008#(= ~manager_state~0 2), 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), 3000#true, Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0), Black: 3002#(= ~manager_state~0 1)]) [2022-07-19 21:31:17,509 INFO L384 tUnfolder$Statistics]: this new event has 212 ancestors and is cut-off event [2022-07-19 21:31:17,509 INFO L387 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-07-19 21:31:17,509 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-07-19 21:31:17,509 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-07-19 21:31:17,536 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][239], [18#L117-1true, 259#true, 3008#(= ~manager_state~0 2), 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), 3000#true, Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), 162#L59true, Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 311#(= ~manager_state~0 0), 13#L157-1true, Black: 3002#(= ~manager_state~0 1)]) [2022-07-19 21:31:17,537 INFO L384 tUnfolder$Statistics]: this new event has 215 ancestors and is cut-off event [2022-07-19 21:31:17,537 INFO L387 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-07-19 21:31:17,537 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-19 21:31:17,537 INFO L387 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-07-19 21:31:17,546 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][239], [18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 3008#(= ~manager_state~0 2), Black: 264#(= (+ (- 1) ~safe~0) 0), 3000#true, Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 311#(= ~manager_state~0 0), 13#L157-1true, Black: 3002#(= ~manager_state~0 1), 55#L66true]) [2022-07-19 21:31:17,546 INFO L384 tUnfolder$Statistics]: this new event has 216 ancestors and is cut-off event [2022-07-19 21:31:17,546 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-07-19 21:31:17,546 INFO L387 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-07-19 21:31:17,546 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-07-19 21:31:17,548 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][239], [18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 3008#(= ~manager_state~0 2), 158#L73-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2991#(= ~node_state~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0), Black: 3002#(= ~manager_state~0 1)]) [2022-07-19 21:31:17,548 INFO L384 tUnfolder$Statistics]: this new event has 216 ancestors and is cut-off event [2022-07-19 21:31:17,548 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-07-19 21:31:17,548 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-07-19 21:31:17,549 INFO L387 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-07-19 21:31:17,556 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][239], [18#L117-1true, 259#true, 3008#(= ~manager_state~0 2), 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2989#true, Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 311#(= ~manager_state~0 0), 13#L157-1true, Black: 3002#(= ~manager_state~0 1), 178#L67true]) [2022-07-19 21:31:17,556 INFO L384 tUnfolder$Statistics]: this new event has 217 ancestors and is cut-off event [2022-07-19 21:31:17,556 INFO L387 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-07-19 21:31:17,556 INFO L387 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-07-19 21:31:17,556 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-07-19 21:31:17,590 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][239], [18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 3008#(= ~manager_state~0 2), Black: 264#(= (+ (- 1) ~safe~0) 0), 3000#true, Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), 162#L59true, Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2991#(= ~node_state~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0), Black: 3002#(= ~manager_state~0 1)]) [2022-07-19 21:31:17,590 INFO L384 tUnfolder$Statistics]: this new event has 219 ancestors and is cut-off event [2022-07-19 21:31:17,591 INFO L387 tUnfolder$Statistics]: existing Event has 219 ancestors and is cut-off event [2022-07-19 21:31:17,591 INFO L387 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-07-19 21:31:17,591 INFO L387 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-07-19 21:31:17,596 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][239], [18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 3008#(= ~manager_state~0 2), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2991#(= ~node_state~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0), Black: 3002#(= ~manager_state~0 1), 55#L66true]) [2022-07-19 21:31:17,596 INFO L384 tUnfolder$Statistics]: this new event has 220 ancestors and is cut-off event [2022-07-19 21:31:17,597 INFO L387 tUnfolder$Statistics]: existing Event has 219 ancestors and is cut-off event [2022-07-19 21:31:17,597 INFO L387 tUnfolder$Statistics]: existing Event has 220 ancestors and is cut-off event [2022-07-19 21:31:17,597 INFO L387 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-07-19 21:31:17,602 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][239], [18#L117-1true, 259#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 3008#(= ~manager_state~0 2), Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 3000#true, Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2991#(= ~node_state~0 0), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2997#(<= ~client_back~0 ~client_front~0), 13#L157-1true, Black: 311#(= ~manager_state~0 0), Black: 3002#(= ~manager_state~0 1), 178#L67true]) [2022-07-19 21:31:17,602 INFO L384 tUnfolder$Statistics]: this new event has 221 ancestors and is cut-off event [2022-07-19 21:31:17,603 INFO L387 tUnfolder$Statistics]: existing Event has 221 ancestors and is cut-off event [2022-07-19 21:31:17,603 INFO L387 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-07-19 21:31:17,603 INFO L387 tUnfolder$Statistics]: existing Event has 220 ancestors and is cut-off event [2022-07-19 21:31:17,626 INFO L129 PetriNetUnfolder]: 940/2635 cut-off events. [2022-07-19 21:31:17,626 INFO L130 PetriNetUnfolder]: For 15676/16519 co-relation queries the response was YES. [2022-07-19 21:31:17,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9689 conditions, 2635 events. 940/2635 cut-off events. For 15676/16519 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 14962 event pairs, 111 based on Foata normal form. 30/2312 useless extension candidates. Maximal degree in co-relation 9661. Up to 833 conditions per place. [2022-07-19 21:31:17,654 INFO L132 encePairwiseOnDemand]: 267/273 looper letters, 47 selfloop transitions, 7 changer transitions 0/288 dead transitions. [2022-07-19 21:31:17,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 288 transitions, 1176 flow [2022-07-19 21:31:17,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:31:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:31:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 744 transitions. [2022-07-19 21:31:17,655 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9084249084249084 [2022-07-19 21:31:17,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 744 transitions. [2022-07-19 21:31:17,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 744 transitions. [2022-07-19 21:31:17,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:17,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 744 transitions. [2022-07-19 21:31:17,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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-07-19 21:31:17,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:17,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:17,659 INFO L186 Difference]: Start difference. First operand has 285 places, 282 transitions, 1035 flow. Second operand 3 states and 744 transitions. [2022-07-19 21:31:17,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 288 transitions, 1176 flow [2022-07-19 21:31:17,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 288 transitions, 1158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:31:17,668 INFO L242 Difference]: Finished difference. Result has 287 places, 279 transitions, 1003 flow [2022-07-19 21:31:17,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1003, PETRI_PLACES=287, PETRI_TRANSITIONS=279} [2022-07-19 21:31:17,669 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 45 predicate places. [2022-07-19 21:31:17,669 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 279 transitions, 1003 flow [2022-07-19 21:31:17,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-07-19 21:31:17,669 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:17,670 INFO L200 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:17,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 21:31:17,670 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-07-19 21:31:17,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:17,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2072705269, now seen corresponding path program 1 times [2022-07-19 21:31:17,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:17,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404583946] [2022-07-19 21:31:17,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:17,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 21:31:17,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:17,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404583946] [2022-07-19 21:31:17,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404583946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:17,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:17,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:31:17,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218016333] [2022-07-19 21:31:17,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:17,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:31:17,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:17,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:31:17,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:31:17,728 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 273 [2022-07-19 21:31:17,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 279 transitions, 1003 flow. Second operand has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 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-07-19 21:31:17,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:17,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 273 [2022-07-19 21:31:17,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:18,054 INFO L129 PetriNetUnfolder]: 507/2264 cut-off events. [2022-07-19 21:31:18,054 INFO L130 PetriNetUnfolder]: For 7364/7753 co-relation queries the response was YES. [2022-07-19 21:31:18,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6493 conditions, 2264 events. 507/2264 cut-off events. For 7364/7753 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 13566 event pairs, 51 based on Foata normal form. 9/2028 useless extension candidates. Maximal degree in co-relation 6464. Up to 561 conditions per place. [2022-07-19 21:31:18,069 INFO L132 encePairwiseOnDemand]: 265/273 looper letters, 75 selfloop transitions, 6 changer transitions 20/303 dead transitions. [2022-07-19 21:31:18,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 303 transitions, 1384 flow [2022-07-19 21:31:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:31:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:31:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1515 transitions. [2022-07-19 21:31:18,071 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.792778649921507 [2022-07-19 21:31:18,071 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1515 transitions. [2022-07-19 21:31:18,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1515 transitions. [2022-07-19 21:31:18,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:18,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1515 transitions. [2022-07-19 21:31:18,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 216.42857142857142) internal successors, (1515), 7 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:31:18,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 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-07-19 21:31:18,075 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 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-07-19 21:31:18,076 INFO L186 Difference]: Start difference. First operand has 287 places, 279 transitions, 1003 flow. Second operand 7 states and 1515 transitions. [2022-07-19 21:31:18,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 303 transitions, 1384 flow [2022-07-19 21:31:18,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 303 transitions, 1370 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:31:18,084 INFO L242 Difference]: Finished difference. Result has 293 places, 280 transitions, 1013 flow [2022-07-19 21:31:18,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1013, PETRI_PLACES=293, PETRI_TRANSITIONS=280} [2022-07-19 21:31:18,085 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 51 predicate places. [2022-07-19 21:31:18,085 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 280 transitions, 1013 flow [2022-07-19 21:31:18,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 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-07-19 21:31:18,085 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:18,085 INFO L200 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:18,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 21:31:18,086 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-07-19 21:31:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:18,086 INFO L85 PathProgramCache]: Analyzing trace with hash -261819937, now seen corresponding path program 1 times [2022-07-19 21:31:18,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:18,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456369996] [2022-07-19 21:31:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:31:18,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:18,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456369996] [2022-07-19 21:31:18,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456369996] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:18,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662207740] [2022-07-19 21:31:18,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:18,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:18,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:18,586 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-07-19 21:31:18,587 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-07-19 21:31:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:18,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-19 21:31:18,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:18,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:31:18,746 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 21:31:18,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-19 21:31:18,776 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-19 21:31:18,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2022-07-19 21:31:18,917 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-07-19 21:31:18,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2022-07-19 21:31:19,156 INFO L356 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-07-19 21:31:19,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 45 [2022-07-19 21:31:19,433 INFO L356 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2022-07-19 21:31:19,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 25 [2022-07-19 21:31:19,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 21:31:19,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:31:19,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:31:19,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:31:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:31:20,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:20,856 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:31:20,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 50 [2022-07-19 21:31:20,865 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-19 21:31:20,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 185 [2022-07-19 21:31:20,874 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:31:20,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 130 [2022-07-19 21:31:20,881 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:31:20,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 106 [2022-07-19 21:31:20,889 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:31:20,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2022-07-19 21:31:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:31:21,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662207740] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:21,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:21,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 21] total 57 [2022-07-19 21:31:21,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874881377] [2022-07-19 21:31:21,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:21,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-19 21:31:21,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:21,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-19 21:31:21,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=2623, Unknown=70, NotChecked=0, Total=3192 [2022-07-19 21:31:21,359 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 273 [2022-07-19 21:31:21,363 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 280 transitions, 1013 flow. Second operand has 57 states, 57 states have (on average 123.54385964912281) internal successors, (7042), 57 states have internal predecessors, (7042), 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-07-19 21:31:21,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:21,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 273 [2022-07-19 21:31:21,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:25,180 INFO L129 PetriNetUnfolder]: 4273/12848 cut-off events. [2022-07-19 21:31:25,180 INFO L130 PetriNetUnfolder]: For 58379/59671 co-relation queries the response was YES. [2022-07-19 21:31:25,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43177 conditions, 12848 events. 4273/12848 cut-off events. For 58379/59671 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 123210 event pairs, 348 based on Foata normal form. 62/11544 useless extension candidates. Maximal degree in co-relation 43146. Up to 3001 conditions per place. [2022-07-19 21:31:25,316 INFO L132 encePairwiseOnDemand]: 244/273 looper letters, 352 selfloop transitions, 50 changer transitions 12/530 dead transitions. [2022-07-19 21:31:25,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 530 transitions, 3537 flow [2022-07-19 21:31:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-19 21:31:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-07-19 21:31:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4504 transitions. [2022-07-19 21:31:25,321 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.4713762428048142 [2022-07-19 21:31:25,321 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 4504 transitions. [2022-07-19 21:31:25,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 4504 transitions. [2022-07-19 21:31:25,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:25,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 4504 transitions. [2022-07-19 21:31:25,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 128.68571428571428) internal successors, (4504), 35 states have internal predecessors, (4504), 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-07-19 21:31:25,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 273.0) internal successors, (9828), 36 states have internal predecessors, (9828), 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-07-19 21:31:25,337 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 273.0) internal successors, (9828), 36 states have internal predecessors, (9828), 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-07-19 21:31:25,337 INFO L186 Difference]: Start difference. First operand has 293 places, 280 transitions, 1013 flow. Second operand 35 states and 4504 transitions. [2022-07-19 21:31:25,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 530 transitions, 3537 flow [2022-07-19 21:31:25,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 530 transitions, 3519 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-07-19 21:31:25,360 INFO L242 Difference]: Finished difference. Result has 335 places, 309 transitions, 1463 flow [2022-07-19 21:31:25,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1463, PETRI_PLACES=335, PETRI_TRANSITIONS=309} [2022-07-19 21:31:25,360 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 93 predicate places. [2022-07-19 21:31:25,361 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 309 transitions, 1463 flow [2022-07-19 21:31:25,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 123.54385964912281) internal successors, (7042), 57 states have internal predecessors, (7042), 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-07-19 21:31:25,363 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:25,363 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:25,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:25,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:25,580 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:31:25,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:25,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2090955172, now seen corresponding path program 1 times [2022-07-19 21:31:25,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:25,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555367485] [2022-07-19 21:31:25,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 21:31:25,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:25,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555367485] [2022-07-19 21:31:25,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555367485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:25,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:25,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 21:31:25,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293184234] [2022-07-19 21:31:25,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:25,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 21:31:25,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:25,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 21:31:25,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 21:31:25,657 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 273 [2022-07-19 21:31:25,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 309 transitions, 1463 flow. Second operand has 4 states, 4 states have (on average 244.5) internal successors, (978), 4 states have internal predecessors, (978), 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-07-19 21:31:25,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:25,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 273 [2022-07-19 21:31:25,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:27,372 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][249], [Black: 3006#true, 4439#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 18#L117-1true, 259#true, 4474#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 158#L73-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 3021#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 4452#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4446#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 4436#(and (or (not (< ~node_back~0 ~node_size~0)) (= (select (select |#memory_int| ~node~0.base) (+ ~node~0.offset (* ~node_back~0 4))) (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset))) (not (<= 0 ~node_back~0))) (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (= (+ (* ~node_front~0 4) ~node~0.offset) 0) (= ~node~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset)) ~update~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4420#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4456#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4427#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~node~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node~0.offset 0) (= ~node_front~0 ~node_back~0) (not (= ~node~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~node~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2989#true, Black: 4416#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4458#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4418#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4454#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4423#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 4412#(and (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4425#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 311#(= ~manager_state~0 0), 13#L157-1true, Black: 3002#(= ~manager_state~0 1)]) [2022-07-19 21:31:27,373 INFO L384 tUnfolder$Statistics]: this new event has 232 ancestors and is cut-off event [2022-07-19 21:31:27,373 INFO L387 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-07-19 21:31:27,373 INFO L387 tUnfolder$Statistics]: existing Event has 227 ancestors and is cut-off event [2022-07-19 21:31:27,373 INFO L387 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-07-19 21:31:27,579 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][248], [Black: 3008#(= ~manager_state~0 2), 18#L117-1true, 259#true, 3033#(and (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 158#L73-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 3021#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), 68#L95-1true, Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4439#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4452#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 4477#(<= ~manager_back~0 (+ ~manager_front~0 1)), Black: 4446#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 4436#(and (or (not (< ~node_back~0 ~node_size~0)) (= (select (select |#memory_int| ~node~0.base) (+ ~node~0.offset (* ~node_back~0 4))) (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset))) (not (<= 0 ~node_back~0))) (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (= (+ (* ~node_front~0 4) ~node~0.offset) 0) (= ~node~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset)) ~update~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4420#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4456#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2989#true, Black: 4427#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~node~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node~0.offset 0) (= ~node_front~0 ~node_back~0) (not (= ~node~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~node~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4416#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4458#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4418#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4454#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4423#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 4412#(and (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4425#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 311#(= ~manager_state~0 0), 13#L157-1true, Black: 3000#true]) [2022-07-19 21:31:27,579 INFO L384 tUnfolder$Statistics]: this new event has 234 ancestors and is cut-off event [2022-07-19 21:31:27,580 INFO L387 tUnfolder$Statistics]: existing Event has 229 ancestors and is cut-off event [2022-07-19 21:31:27,580 INFO L387 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-07-19 21:31:27,580 INFO L387 tUnfolder$Statistics]: existing Event has 229 ancestors and is cut-off event [2022-07-19 21:31:27,877 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][248], [Black: 3006#true, 18#L117-1true, 259#true, 3033#(and (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 158#L73-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 3021#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), 68#L95-1true, Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4439#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 4477#(<= ~manager_back~0 (+ ~manager_front~0 1)), Black: 4452#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4446#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4436#(and (or (not (< ~node_back~0 ~node_size~0)) (= (select (select |#memory_int| ~node~0.base) (+ ~node~0.offset (* ~node_back~0 4))) (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset))) (not (<= 0 ~node_back~0))) (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (= (+ (* ~node_front~0 4) ~node~0.offset) 0) (= ~node~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset)) ~update~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 4420#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4456#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 2989#true, Black: 4427#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~node~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node~0.offset 0) (= ~node_front~0 ~node_back~0) (not (= ~node~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~node~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4416#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4458#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4418#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4454#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 4423#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 4412#(and (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4425#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 13#L157-1true, Black: 311#(= ~manager_state~0 0), Black: 3002#(= ~manager_state~0 1)]) [2022-07-19 21:31:27,877 INFO L384 tUnfolder$Statistics]: this new event has 239 ancestors and is cut-off event [2022-07-19 21:31:27,877 INFO L387 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-07-19 21:31:27,877 INFO L387 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-07-19 21:31:27,877 INFO L387 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-07-19 21:31:28,968 INFO L129 PetriNetUnfolder]: 5238/20036 cut-off events. [2022-07-19 21:31:28,968 INFO L130 PetriNetUnfolder]: For 94193/98432 co-relation queries the response was YES. [2022-07-19 21:31:29,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64324 conditions, 20036 events. 5238/20036 cut-off events. For 94193/98432 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 233140 event pairs, 747 based on Foata normal form. 150/17328 useless extension candidates. Maximal degree in co-relation 64280. Up to 4273 conditions per place. [2022-07-19 21:31:29,232 INFO L132 encePairwiseOnDemand]: 268/273 looper letters, 93 selfloop transitions, 24 changer transitions 3/369 dead transitions. [2022-07-19 21:31:29,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 369 transitions, 2517 flow [2022-07-19 21:31:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 21:31:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-19 21:31:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1004 transitions. [2022-07-19 21:31:29,234 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2022-07-19 21:31:29,234 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1004 transitions. [2022-07-19 21:31:29,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1004 transitions. [2022-07-19 21:31:29,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:29,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1004 transitions. [2022-07-19 21:31:29,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 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-07-19 21:31:29,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 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-07-19 21:31:29,237 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 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-07-19 21:31:29,237 INFO L186 Difference]: Start difference. First operand has 335 places, 309 transitions, 1463 flow. Second operand 4 states and 1004 transitions. [2022-07-19 21:31:29,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 369 transitions, 2517 flow [2022-07-19 21:31:29,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 369 transitions, 2327 flow, removed 78 selfloop flow, removed 17 redundant places. [2022-07-19 21:31:29,297 INFO L242 Difference]: Finished difference. Result has 319 places, 320 transitions, 1655 flow [2022-07-19 21:31:29,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1655, PETRI_PLACES=319, PETRI_TRANSITIONS=320} [2022-07-19 21:31:29,298 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 77 predicate places. [2022-07-19 21:31:29,298 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 320 transitions, 1655 flow [2022-07-19 21:31:29,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 244.5) internal successors, (978), 4 states have internal predecessors, (978), 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-07-19 21:31:29,298 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:29,299 INFO L200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:29,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 21:31:29,299 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:31:29,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:29,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1974282468, now seen corresponding path program 2 times [2022-07-19 21:31:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:29,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656553326] [2022-07-19 21:31:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:29,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 21:31:29,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:29,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656553326] [2022-07-19 21:31:29,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656553326] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:29,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255332669] [2022-07-19 21:31:29,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:31:29,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:29,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:29,341 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-07-19 21:31:29,353 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-07-19 21:31:29,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:31:29,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:29,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 21:31:29,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 21:31:29,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:31:29,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255332669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:29,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:31:29,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-19 21:31:29,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103824573] [2022-07-19 21:31:29,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:29,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:31:29,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:29,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:31:29,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 21:31:29,493 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 273 [2022-07-19 21:31:29,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 320 transitions, 1655 flow. Second operand has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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-07-19 21:31:29,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:29,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 273 [2022-07-19 21:31:29,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:32,684 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][274], [Black: 4477#(<= ~manager_back~0 (+ ~manager_front~0 1)), 18#L117-1true, Black: 3008#(= ~manager_state~0 2), 259#true, 153#L96true, 4474#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 211#L158-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), 5076#(<= 1 ~node_state~0), Black: 3021#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4439#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4446#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 4436#(and (or (not (< ~node_back~0 ~node_size~0)) (= (select (select |#memory_int| ~node~0.base) (+ ~node~0.offset (* ~node_back~0 4))) (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset))) (not (<= 0 ~node_back~0))) (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (= (+ (* ~node_front~0 4) ~node~0.offset) 0) (= ~node~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset)) ~update~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4420#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2991#(= ~node_state~0 0), Black: 4427#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~node~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node~0.offset 0) (= ~node_front~0 ~node_back~0) (not (= ~node~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~node~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4416#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4418#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 4423#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4412#(and (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4425#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 309#true, 4448#(and (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3002#(= ~manager_state~0 1), Black: 4476#(<= ~manager_back~0 ~manager_front~0)]) [2022-07-19 21:31:32,684 INFO L384 tUnfolder$Statistics]: this new event has 233 ancestors and is cut-off event [2022-07-19 21:31:32,685 INFO L387 tUnfolder$Statistics]: existing Event has 224 ancestors and is cut-off event [2022-07-19 21:31:32,685 INFO L387 tUnfolder$Statistics]: existing Event has 228 ancestors and is cut-off event [2022-07-19 21:31:32,685 INFO L387 tUnfolder$Statistics]: existing Event has 229 ancestors and is cut-off event [2022-07-19 21:31:33,137 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][274], [Black: 4477#(<= ~manager_back~0 (+ ~manager_front~0 1)), 18#L117-1true, Black: 3008#(= ~manager_state~0 2), 259#true, 4474#true, 153#L96true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 211#L158-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), 5076#(<= 1 ~node_state~0), Black: 3021#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4439#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4446#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 4436#(and (or (not (< ~node_back~0 ~node_size~0)) (= (select (select |#memory_int| ~node~0.base) (+ ~node~0.offset (* ~node_back~0 4))) (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset))) (not (<= 0 ~node_back~0))) (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (= (+ (* ~node_front~0 4) ~node~0.offset) 0) (= ~node~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset)) ~update~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4420#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2991#(= ~node_state~0 0), Black: 4427#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~node~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node~0.offset 0) (= ~node_front~0 ~node_back~0) (not (= ~node~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~node~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4416#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4418#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 4423#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4412#(and (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4425#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 311#(= ~manager_state~0 0), 4448#(and (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3000#true, Black: 4476#(<= ~manager_back~0 ~manager_front~0)]) [2022-07-19 21:31:33,137 INFO L384 tUnfolder$Statistics]: this new event has 237 ancestors and is cut-off event [2022-07-19 21:31:33,138 INFO L387 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-07-19 21:31:33,138 INFO L387 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-07-19 21:31:33,138 INFO L387 tUnfolder$Statistics]: existing Event has 228 ancestors and is cut-off event [2022-07-19 21:31:33,536 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][274], [Black: 4477#(<= ~manager_back~0 (+ ~manager_front~0 1)), 18#L117-1true, Black: 3008#(= ~manager_state~0 2), 259#true, 3033#(and (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 153#L96true, 4474#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 211#L158-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 3021#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 5076#(<= 1 ~node_state~0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 4439#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4446#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 4436#(and (or (not (< ~node_back~0 ~node_size~0)) (= (select (select |#memory_int| ~node~0.base) (+ ~node~0.offset (* ~node_back~0 4))) (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset))) (not (<= 0 ~node_back~0))) (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (= (+ (* ~node_front~0 4) ~node~0.offset) 0) (= ~node~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset)) ~update~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4420#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2991#(= ~node_state~0 0), Black: 4427#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~node~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node~0.offset 0) (= ~node_front~0 ~node_back~0) (not (= ~node~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~node~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4416#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4418#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 4423#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4412#(and (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 309#true, Black: 4425#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3002#(= ~manager_state~0 1), Black: 4476#(<= ~manager_back~0 ~manager_front~0)]) [2022-07-19 21:31:33,536 INFO L384 tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event [2022-07-19 21:31:33,536 INFO L387 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-07-19 21:31:33,536 INFO L387 tUnfolder$Statistics]: existing Event has 236 ancestors and is cut-off event [2022-07-19 21:31:33,536 INFO L387 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-07-19 21:31:33,713 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][274], [Black: 4477#(<= ~manager_back~0 (+ ~manager_front~0 1)), Black: 3006#true, 18#L117-1true, 259#true, 153#L96true, 4474#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 211#L158-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), 5076#(<= 1 ~node_state~0), Black: 3021#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 4439#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4446#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4436#(and (or (not (< ~node_back~0 ~node_size~0)) (= (select (select |#memory_int| ~node~0.base) (+ ~node~0.offset (* ~node_back~0 4))) (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset))) (not (<= 0 ~node_back~0))) (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (= (+ (* ~node_front~0 4) ~node~0.offset) 0) (= ~node~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset)) ~update~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 4420#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2991#(= ~node_state~0 0), Black: 4427#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~node~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node~0.offset 0) (= ~node_front~0 ~node_back~0) (not (= ~node~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~node~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4416#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4418#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 4423#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4412#(and (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4425#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 4448#(and (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 311#(= ~manager_state~0 0), Black: 3002#(= ~manager_state~0 1), Black: 4476#(<= ~manager_back~0 ~manager_front~0)]) [2022-07-19 21:31:33,714 INFO L384 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-07-19 21:31:33,714 INFO L387 tUnfolder$Statistics]: existing Event has 238 ancestors and is cut-off event [2022-07-19 21:31:33,714 INFO L387 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-07-19 21:31:33,714 INFO L387 tUnfolder$Statistics]: existing Event has 237 ancestors and is cut-off event [2022-07-19 21:31:34,047 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][274], [Black: 4477#(<= ~manager_back~0 (+ ~manager_front~0 1)), Black: 3008#(= ~manager_state~0 2), 18#L117-1true, 259#true, 153#L96true, 4474#true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 211#L158-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), 5076#(<= 1 ~node_state~0), Black: 3021#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 4439#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4446#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4436#(and (or (not (< ~node_back~0 ~node_size~0)) (= (select (select |#memory_int| ~node~0.base) (+ ~node~0.offset (* ~node_back~0 4))) (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset))) (not (<= 0 ~node_back~0))) (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (= (+ (* ~node_front~0 4) ~node~0.offset) 0) (= ~node~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset)) ~update~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 4420#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2991#(= ~node_state~0 0), Black: 4427#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~node~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node~0.offset 0) (= ~node_front~0 ~node_back~0) (not (= ~node~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~node~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4416#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4418#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 4423#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4412#(and (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4425#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 4448#(and (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 311#(= ~manager_state~0 0), Black: 3002#(= ~manager_state~0 1), Black: 4476#(<= ~manager_back~0 ~manager_front~0)]) [2022-07-19 21:31:34,047 INFO L384 tUnfolder$Statistics]: this new event has 248 ancestors and is cut-off event [2022-07-19 21:31:34,047 INFO L387 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-07-19 21:31:34,047 INFO L387 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-07-19 21:31:34,047 INFO L387 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-07-19 21:31:34,236 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1020] L111-->L117-1: Formula: (and (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~manager_back~0_111 (+ v_~manager_back~0_112 1)) (= v_~client_state~0_24 1) (= (ite (= v_~update~0_47 (select (select |v_#memory_int_114| v_~manager~0.base_57) (+ (* v_~manager_back~0_112 4) v_~manager~0.offset_57))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= 0 (ite (and (< v_~manager_back~0_112 v_~manager_size~0_36) (<= 0 v_~manager_back~0_112)) 1 0))) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~manager~0.offset=v_~manager~0.offset_57, ~manager~0.base=v_~manager~0.base_57, #memory_int=|v_#memory_int_114|, ~manager_back~0=v_~manager_back~0_112, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} OutVars{thread3Thread1of1ForFork0_#t~mem16#1=|v_thread3Thread1of1ForFork0_#t~mem16#1_1|, ~manager~0.offset=v_~manager~0.offset_57, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~manager~0.base=v_~manager~0.base_57, thread3Thread1of1ForFork0_#t~post17#1=|v_thread3Thread1of1ForFork0_#t~post17#1_1|, #memory_int=|v_#memory_int_114|, ~client_state~0=v_~client_state~0_24, ~manager_back~0=v_~manager_back~0_111, ~manager_size~0=v_~manager_size~0_36, ~update~0=v_~update~0_47} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem16#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#t~post17#1, ~client_state~0, ~manager_back~0][274], [Black: 4477#(<= ~manager_back~0 (+ ~manager_front~0 1)), Black: 3008#(= ~manager_state~0 2), 18#L117-1true, 259#true, 3033#(and (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 4474#true, 153#L96true, 2966#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), 211#L158-1true, Black: 264#(= (+ (- 1) ~safe~0) 0), Black: 3021#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 5076#(<= 1 ~node_state~0), Black: 277#(or (<= ~manager_size~0 ~manager_front~0) (<= ~manager_back~0 ~manager_front~0) (not (<= 0 ~manager_front~0))), Black: 282#(<= ~node_back~0 ~node_front~0), Black: 288#(= ~client_state~0 0), Black: 1626#(and (= ~safe~0 1) (= ~manager~0.offset 0) (< 0 (+ (* ~manager_front~0 4) ~manager~0.offset 1)) (<= ~manager_front~0 0) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1601#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 1605#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1))), Black: 1628#(and (= ~safe~0 1) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 2958#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1616#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1603#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 2964#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 2960#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (<= 1 ~manager_back~0) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|)), Black: 1607#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1609#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 871#(= ~safe~0 1), Black: 4439#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~node_front~0 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2962#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< ~manager_front~0 1) (<= 0 ~manager_front~0) (= ~manager~0.offset 0) (or (not (< ~manager_back~0 ~manager_size~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= 0 ~manager_back~0)) (= (* ~manager_front~0 4) (* ~manager_back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select (select |#memory_int| ~manager~0.base) (+ (* ~manager_front~0 4) ~manager~0.offset)) ~update~0)), Black: 1611#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~manager~0.offset 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ ~manager~0.base 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< (+ |ULTIMATE.start_main_#t~ret22#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= |ULTIMATE.start_main_#t~ret22#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~manager_size~0 ~manager_front~0) (+ ~manager_back~0 1)) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4446#(and (= ~safe~0 1) (or (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (<= (+ ~node_front~0 1) 0)) (or (<= ~node_back~0 ~node_front~0) (not (<= (+ ~node_front~0 1) 0))) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1597#(and (= ~safe~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~manager_back~0 ~manager_front~0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |ULTIMATE.start_main_~#t3~0#1.base|)), Black: 4436#(and (or (not (< ~node_back~0 ~node_size~0)) (= (select (select |#memory_int| ~node~0.base) (+ ~node~0.offset (* ~node_back~0 4))) (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset))) (not (<= 0 ~node_back~0))) (<= (+ ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0)) (= (+ (* ~node_front~0 4) ~node~0.offset) 0) (= ~node~0.offset 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= (select (select |#memory_int| ~node~0.base) (+ (* ~node_front~0 4) ~node~0.offset)) ~update~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~node_front~0 ~node_size~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~node_back~0 1)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4420#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 2991#(= ~node_state~0 0), Black: 4427#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~node~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node~0.offset 0) (= ~node_front~0 ~node_back~0) (not (= ~node~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= ~node~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4416#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post41#1| 0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 301#(and (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~manager_size~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 4418#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4423#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2997#(<= ~client_back~0 ~client_front~0), Black: 4412#(and (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4425#(and (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~safe~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~node_front~0 ~node_back~0) (<= ~node_size~0 1) (not (= |ULTIMATE.start_main_#t~ret28#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~node_size~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |ULTIMATE.start_main_#t~ret28#1.offset|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 311#(= ~manager_state~0 0), Black: 3002#(= ~manager_state~0 1), Black: 4476#(<= ~manager_back~0 ~manager_front~0)]) [2022-07-19 21:31:34,236 INFO L384 tUnfolder$Statistics]: this new event has 255 ancestors and is cut-off event [2022-07-19 21:31:34,236 INFO L387 tUnfolder$Statistics]: existing Event has 246 ancestors and is cut-off event [2022-07-19 21:31:34,236 INFO L387 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-07-19 21:31:34,236 INFO L387 tUnfolder$Statistics]: existing Event has 250 ancestors and is cut-off event [2022-07-19 21:31:34,465 INFO L129 PetriNetUnfolder]: 9733/29663 cut-off events. [2022-07-19 21:31:34,466 INFO L130 PetriNetUnfolder]: For 199714/207111 co-relation queries the response was YES. [2022-07-19 21:31:34,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110373 conditions, 29663 events. 9733/29663 cut-off events. For 199714/207111 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 347717 event pairs, 2189 based on Foata normal form. 235/25385 useless extension candidates. Maximal degree in co-relation 110331. Up to 7742 conditions per place. [2022-07-19 21:31:34,806 INFO L132 encePairwiseOnDemand]: 270/273 looper letters, 82 selfloop transitions, 14 changer transitions 0/343 dead transitions. [2022-07-19 21:31:34,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 343 transitions, 2181 flow [2022-07-19 21:31:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:31:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:31:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2022-07-19 21:31:34,807 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2022-07-19 21:31:34,807 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2022-07-19 21:31:34,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2022-07-19 21:31:34,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:34,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2022-07-19 21:31:34,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 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-07-19 21:31:34,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:34,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:34,809 INFO L186 Difference]: Start difference. First operand has 319 places, 320 transitions, 1655 flow. Second operand 3 states and 749 transitions. [2022-07-19 21:31:34,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 343 transitions, 2181 flow [2022-07-19 21:31:34,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 343 transitions, 2131 flow, removed 25 selfloop flow, removed 0 redundant places. [2022-07-19 21:31:34,861 INFO L242 Difference]: Finished difference. Result has 321 places, 319 transitions, 1647 flow [2022-07-19 21:31:34,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1619, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1647, PETRI_PLACES=321, PETRI_TRANSITIONS=319} [2022-07-19 21:31:34,861 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 79 predicate places. [2022-07-19 21:31:34,861 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 319 transitions, 1647 flow [2022-07-19 21:31:34,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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-07-19 21:31:34,862 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:34,862 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:34,881 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-07-19 21:31:35,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 21:31:35,076 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:31:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:35,076 INFO L85 PathProgramCache]: Analyzing trace with hash -524553725, now seen corresponding path program 2 times [2022-07-19 21:31:35,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:35,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148631661] [2022-07-19 21:31:35,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:35,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 21:31:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:35,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148631661] [2022-07-19 21:31:35,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148631661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:35,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:35,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:31:35,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616498757] [2022-07-19 21:31:35,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:35,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:31:35,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:35,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:31:35,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:31:35,120 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 273 [2022-07-19 21:31:35,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 319 transitions, 1647 flow. Second operand has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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-07-19 21:31:35,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:35,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 273 [2022-07-19 21:31:35,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:37,323 INFO L129 PetriNetUnfolder]: 3367/13124 cut-off events. [2022-07-19 21:31:37,323 INFO L130 PetriNetUnfolder]: For 65721/69130 co-relation queries the response was YES. [2022-07-19 21:31:37,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42341 conditions, 13124 events. 3367/13124 cut-off events. For 65721/69130 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 139062 event pairs, 1336 based on Foata normal form. 34/11820 useless extension candidates. Maximal degree in co-relation 42298. Up to 3410 conditions per place. [2022-07-19 21:31:37,542 INFO L132 encePairwiseOnDemand]: 269/273 looper letters, 54 selfloop transitions, 6 changer transitions 2/308 dead transitions. [2022-07-19 21:31:37,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 308 transitions, 1646 flow [2022-07-19 21:31:37,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:31:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:31:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2022-07-19 21:31:37,544 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9145299145299145 [2022-07-19 21:31:37,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 749 transitions. [2022-07-19 21:31:37,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 749 transitions. [2022-07-19 21:31:37,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:37,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 749 transitions. [2022-07-19 21:31:37,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 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-07-19 21:31:37,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:37,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:31:37,545 INFO L186 Difference]: Start difference. First operand has 321 places, 319 transitions, 1647 flow. Second operand 3 states and 749 transitions. [2022-07-19 21:31:37,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 308 transitions, 1646 flow [2022-07-19 21:31:37,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 308 transitions, 1583 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-07-19 21:31:37,571 INFO L242 Difference]: Finished difference. Result has 317 places, 292 transitions, 1264 flow [2022-07-19 21:31:37,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=317, PETRI_TRANSITIONS=292} [2022-07-19 21:31:37,572 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 75 predicate places. [2022-07-19 21:31:37,572 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 292 transitions, 1264 flow [2022-07-19 21:31:37,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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-07-19 21:31:37,572 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:37,572 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:37,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 21:31:37,573 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:31:37,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1124516109, now seen corresponding path program 1 times [2022-07-19 21:31:37,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:37,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377125716] [2022-07-19 21:31:37,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:37,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 21:31:37,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:37,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377125716] [2022-07-19 21:31:37,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377125716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:37,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405452269] [2022-07-19 21:31:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:37,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:37,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:37,650 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-07-19 21:31:37,652 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-07-19 21:31:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:37,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 21:31:37,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 21:31:37,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 21:31:38,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405452269] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:38,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:38,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-07-19 21:31:38,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125477698] [2022-07-19 21:31:38,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:38,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 21:31:38,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:38,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 21:31:38,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:31:38,229 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 273 [2022-07-19 21:31:38,230 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 292 transitions, 1264 flow. Second operand has 19 states, 19 states have (on average 206.31578947368422) internal successors, (3920), 19 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-07-19 21:31:38,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:38,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 273 [2022-07-19 21:31:38,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:39,576 INFO L129 PetriNetUnfolder]: 1260/6825 cut-off events. [2022-07-19 21:31:39,576 INFO L130 PetriNetUnfolder]: For 36393/37970 co-relation queries the response was YES. [2022-07-19 21:31:39,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20915 conditions, 6825 events. 1260/6825 cut-off events. For 36393/37970 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 65495 event pairs, 454 based on Foata normal form. 7/6197 useless extension candidates. Maximal degree in co-relation 20873. Up to 1775 conditions per place. [2022-07-19 21:31:39,644 INFO L132 encePairwiseOnDemand]: 254/273 looper letters, 70 selfloop transitions, 20 changer transitions 61/339 dead transitions. [2022-07-19 21:31:39,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 339 transitions, 1755 flow [2022-07-19 21:31:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 21:31:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-19 21:31:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3541 transitions. [2022-07-19 21:31:39,647 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7629821159232923 [2022-07-19 21:31:39,647 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3541 transitions. [2022-07-19 21:31:39,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3541 transitions. [2022-07-19 21:31:39,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:39,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3541 transitions. [2022-07-19 21:31:39,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 208.2941176470588) internal successors, (3541), 17 states have internal predecessors, (3541), 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-07-19 21:31:39,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 273.0) internal successors, (4914), 18 states have internal predecessors, (4914), 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-07-19 21:31:39,653 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 273.0) internal successors, (4914), 18 states have internal predecessors, (4914), 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-07-19 21:31:39,653 INFO L186 Difference]: Start difference. First operand has 317 places, 292 transitions, 1264 flow. Second operand 17 states and 3541 transitions. [2022-07-19 21:31:39,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 339 transitions, 1755 flow [2022-07-19 21:31:39,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 339 transitions, 1743 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-19 21:31:39,670 INFO L242 Difference]: Finished difference. Result has 333 places, 274 transitions, 1115 flow [2022-07-19 21:31:39,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1115, PETRI_PLACES=333, PETRI_TRANSITIONS=274} [2022-07-19 21:31:39,671 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 91 predicate places. [2022-07-19 21:31:39,671 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 274 transitions, 1115 flow [2022-07-19 21:31:39,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 206.31578947368422) internal successors, (3920), 19 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-07-19 21:31:39,672 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:39,672 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:39,689 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-07-19 21:31:39,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:39,880 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:31:39,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1154365520, now seen corresponding path program 2 times [2022-07-19 21:31:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:39,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876680363] [2022-07-19 21:31:39,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:39,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 21:31:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:40,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876680363] [2022-07-19 21:31:40,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876680363] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:40,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619859518] [2022-07-19 21:31:40,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:31:40,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:40,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:40,056 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-07-19 21:31:40,057 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-07-19 21:31:40,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:31:40,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:40,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 21:31:40,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 21:31:40,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 21:31:40,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619859518] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:40,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:40,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-19 21:31:40,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89506377] [2022-07-19 21:31:40,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:40,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 21:31:40,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:40,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 21:31:40,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-07-19 21:31:40,946 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 273 [2022-07-19 21:31:40,948 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 274 transitions, 1115 flow. Second operand has 28 states, 28 states have (on average 203.57142857142858) internal successors, (5700), 28 states have internal predecessors, (5700), 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-07-19 21:31:40,948 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:40,948 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 273 [2022-07-19 21:31:40,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:42,105 INFO L129 PetriNetUnfolder]: 855/5057 cut-off events. [2022-07-19 21:31:42,106 INFO L130 PetriNetUnfolder]: For 25605/26780 co-relation queries the response was YES. [2022-07-19 21:31:42,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14761 conditions, 5057 events. 855/5057 cut-off events. For 25605/26780 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 46701 event pairs, 306 based on Foata normal form. 122/4718 useless extension candidates. Maximal degree in co-relation 14717. Up to 914 conditions per place. [2022-07-19 21:31:42,166 INFO L132 encePairwiseOnDemand]: 254/273 looper letters, 94 selfloop transitions, 26 changer transitions 9/315 dead transitions. [2022-07-19 21:31:42,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 315 transitions, 1796 flow [2022-07-19 21:31:42,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 21:31:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-07-19 21:31:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3909 transitions. [2022-07-19 21:31:42,170 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7536148062463852 [2022-07-19 21:31:42,170 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3909 transitions. [2022-07-19 21:31:42,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3909 transitions. [2022-07-19 21:31:42,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:42,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3909 transitions. [2022-07-19 21:31:42,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 205.73684210526315) internal successors, (3909), 19 states have internal predecessors, (3909), 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-07-19 21:31:42,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 273.0) internal successors, (5460), 20 states have internal predecessors, (5460), 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-07-19 21:31:42,178 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 273.0) internal successors, (5460), 20 states have internal predecessors, (5460), 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-07-19 21:31:42,179 INFO L186 Difference]: Start difference. First operand has 333 places, 274 transitions, 1115 flow. Second operand 19 states and 3909 transitions. [2022-07-19 21:31:42,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 315 transitions, 1796 flow [2022-07-19 21:31:42,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 315 transitions, 1706 flow, removed 20 selfloop flow, removed 21 redundant places. [2022-07-19 21:31:42,198 INFO L242 Difference]: Finished difference. Result has 317 places, 274 transitions, 1098 flow [2022-07-19 21:31:42,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1098, PETRI_PLACES=317, PETRI_TRANSITIONS=274} [2022-07-19 21:31:42,199 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 75 predicate places. [2022-07-19 21:31:42,199 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 274 transitions, 1098 flow [2022-07-19 21:31:42,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 203.57142857142858) internal successors, (5700), 28 states have internal predecessors, (5700), 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-07-19 21:31:42,200 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:42,200 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:42,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 21:31:42,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:42,404 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:31:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:42,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1756029933, now seen corresponding path program 1 times [2022-07-19 21:31:42,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:42,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52582784] [2022-07-19 21:31:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:42,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:31:42,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:42,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52582784] [2022-07-19 21:31:42,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52582784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:42,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98236564] [2022-07-19 21:31:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:42,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:42,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:42,855 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-07-19 21:31:42,856 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-07-19 21:31:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:42,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-19 21:31:42,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:43,816 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:31:43,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2022-07-19 21:31:43,821 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:31:43,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 3 [2022-07-19 21:31:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:31:43,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:43,942 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-19 21:31:43,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-07-19 21:31:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 21:31:45,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98236564] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:45,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:45,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 47 [2022-07-19 21:31:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456734820] [2022-07-19 21:31:45,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:45,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-19 21:31:45,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:45,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-19 21:31:45,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1901, Unknown=0, NotChecked=0, Total=2162 [2022-07-19 21:31:45,501 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 273 [2022-07-19 21:31:45,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 274 transitions, 1098 flow. Second operand has 47 states, 47 states have (on average 146.36170212765958) internal successors, (6879), 47 states have internal predecessors, (6879), 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-07-19 21:31:45,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:45,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 273 [2022-07-19 21:31:45,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:49,458 INFO L129 PetriNetUnfolder]: 1802/10465 cut-off events. [2022-07-19 21:31:49,458 INFO L130 PetriNetUnfolder]: For 43386/44766 co-relation queries the response was YES. [2022-07-19 21:31:49,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29930 conditions, 10465 events. 1802/10465 cut-off events. For 43386/44766 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 113319 event pairs, 202 based on Foata normal form. 44/9623 useless extension candidates. Maximal degree in co-relation 29892. Up to 1980 conditions per place. [2022-07-19 21:31:49,589 INFO L132 encePairwiseOnDemand]: 237/273 looper letters, 270 selfloop transitions, 85 changer transitions 44/530 dead transitions. [2022-07-19 21:31:49,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 530 transitions, 3789 flow [2022-07-19 21:31:49,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-19 21:31:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-07-19 21:31:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 7075 transitions. [2022-07-19 21:31:49,596 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5399114774114774 [2022-07-19 21:31:49,596 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 7075 transitions. [2022-07-19 21:31:49,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 7075 transitions. [2022-07-19 21:31:49,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:49,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 7075 transitions. [2022-07-19 21:31:49,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 147.39583333333334) internal successors, (7075), 48 states have internal predecessors, (7075), 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-07-19 21:31:49,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 273.0) internal successors, (13377), 49 states have internal predecessors, (13377), 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-07-19 21:31:49,613 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 273.0) internal successors, (13377), 49 states have internal predecessors, (13377), 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-07-19 21:31:49,613 INFO L186 Difference]: Start difference. First operand has 317 places, 274 transitions, 1098 flow. Second operand 48 states and 7075 transitions. [2022-07-19 21:31:49,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 530 transitions, 3789 flow [2022-07-19 21:31:49,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 530 transitions, 3709 flow, removed 7 selfloop flow, removed 13 redundant places. [2022-07-19 21:31:49,634 INFO L242 Difference]: Finished difference. Result has 376 places, 336 transitions, 2209 flow [2022-07-19 21:31:49,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=2209, PETRI_PLACES=376, PETRI_TRANSITIONS=336} [2022-07-19 21:31:49,634 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 134 predicate places. [2022-07-19 21:31:49,635 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 336 transitions, 2209 flow [2022-07-19 21:31:49,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 146.36170212765958) internal successors, (6879), 47 states have internal predecessors, (6879), 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-07-19 21:31:49,636 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:49,636 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:49,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-19 21:31:49,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:49,839 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:31:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:49,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1746706080, now seen corresponding path program 3 times [2022-07-19 21:31:49,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:49,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221164475] [2022-07-19 21:31:49,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:49,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 21:31:49,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:49,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221164475] [2022-07-19 21:31:49,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221164475] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:31:49,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100124666] [2022-07-19 21:31:49,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:31:49,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:31:49,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:31:49,920 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-07-19 21:31:49,921 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-07-19 21:31:50,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-19 21:31:50,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:31:50,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:31:50,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:31:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 21:31:50,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:31:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 21:31:50,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100124666] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:31:50,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:31:50,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2022-07-19 21:31:50,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456861914] [2022-07-19 21:31:50,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:31:50,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:31:50,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:50,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:31:50,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:31:50,428 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 273 [2022-07-19 21:31:50,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 336 transitions, 2209 flow. Second operand has 7 states, 7 states have (on average 244.85714285714286) internal successors, (1714), 7 states have internal predecessors, (1714), 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-07-19 21:31:50,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:50,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 273 [2022-07-19 21:31:50,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:53,420 INFO L129 PetriNetUnfolder]: 2439/14287 cut-off events. [2022-07-19 21:31:53,420 INFO L130 PetriNetUnfolder]: For 92766/95501 co-relation queries the response was YES. [2022-07-19 21:31:53,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46956 conditions, 14287 events. 2439/14287 cut-off events. For 92766/95501 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 165566 event pairs, 545 based on Foata normal form. 119/13198 useless extension candidates. Maximal degree in co-relation 46894. Up to 2430 conditions per place. [2022-07-19 21:31:53,570 INFO L132 encePairwiseOnDemand]: 268/273 looper letters, 87 selfloop transitions, 13 changer transitions 0/357 dead transitions. [2022-07-19 21:31:53,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 357 transitions, 2661 flow [2022-07-19 21:31:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 21:31:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-19 21:31:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1245 transitions. [2022-07-19 21:31:53,572 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9120879120879121 [2022-07-19 21:31:53,572 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1245 transitions. [2022-07-19 21:31:53,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1245 transitions. [2022-07-19 21:31:53,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:53,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1245 transitions. [2022-07-19 21:31:53,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 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-07-19 21:31:53,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 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-07-19 21:31:53,575 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 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-07-19 21:31:53,575 INFO L186 Difference]: Start difference. First operand has 376 places, 336 transitions, 2209 flow. Second operand 5 states and 1245 transitions. [2022-07-19 21:31:53,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 357 transitions, 2661 flow [2022-07-19 21:31:53,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 357 transitions, 2512 flow, removed 57 selfloop flow, removed 23 redundant places. [2022-07-19 21:31:53,682 INFO L242 Difference]: Finished difference. Result has 348 places, 313 transitions, 1644 flow [2022-07-19 21:31:53,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1644, PETRI_PLACES=348, PETRI_TRANSITIONS=313} [2022-07-19 21:31:53,683 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 106 predicate places. [2022-07-19 21:31:53,683 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 313 transitions, 1644 flow [2022-07-19 21:31:53,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 244.85714285714286) internal successors, (1714), 7 states have internal predecessors, (1714), 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-07-19 21:31:53,684 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:53,684 INFO L200 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:53,701 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-07-19 21:31:53,884 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,SelfDestructingSolverStorable21 [2022-07-19 21:31:53,884 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:31:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1309192208, now seen corresponding path program 1 times [2022-07-19 21:31:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:53,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079785751] [2022-07-19 21:31:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-19 21:31:53,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:53,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079785751] [2022-07-19 21:31:53,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079785751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:53,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:53,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 21:31:53,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812970572] [2022-07-19 21:31:53,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:53,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:31:53,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:53,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:31:53,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:31:53,951 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 273 [2022-07-19 21:31:53,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 313 transitions, 1644 flow. Second operand has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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-07-19 21:31:53,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:53,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 273 [2022-07-19 21:31:53,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:31:57,086 INFO L129 PetriNetUnfolder]: 2557/15927 cut-off events. [2022-07-19 21:31:57,086 INFO L130 PetriNetUnfolder]: For 82999/86024 co-relation queries the response was YES. [2022-07-19 21:31:57,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47235 conditions, 15927 events. 2557/15927 cut-off events. For 82999/86024 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 185005 event pairs, 852 based on Foata normal form. 25/14458 useless extension candidates. Maximal degree in co-relation 47181. Up to 3644 conditions per place. [2022-07-19 21:31:57,299 INFO L132 encePairwiseOnDemand]: 263/273 looper letters, 149 selfloop transitions, 13 changer transitions 8/371 dead transitions. [2022-07-19 21:31:57,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 371 transitions, 2532 flow [2022-07-19 21:31:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:31:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:31:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1945 transitions. [2022-07-19 21:31:57,301 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7916157916157917 [2022-07-19 21:31:57,301 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1945 transitions. [2022-07-19 21:31:57,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1945 transitions. [2022-07-19 21:31:57,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:31:57,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1945 transitions. [2022-07-19 21:31:57,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 216.11111111111111) internal successors, (1945), 9 states have internal predecessors, (1945), 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-07-19 21:31:57,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 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-07-19 21:31:57,305 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 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-07-19 21:31:57,305 INFO L186 Difference]: Start difference. First operand has 348 places, 313 transitions, 1644 flow. Second operand 9 states and 1945 transitions. [2022-07-19 21:31:57,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 371 transitions, 2532 flow [2022-07-19 21:31:57,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 371 transitions, 2512 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-07-19 21:31:57,343 INFO L242 Difference]: Finished difference. Result has 357 places, 318 transitions, 1687 flow [2022-07-19 21:31:57,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1687, PETRI_PLACES=357, PETRI_TRANSITIONS=318} [2022-07-19 21:31:57,344 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 115 predicate places. [2022-07-19 21:31:57,344 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 318 transitions, 1687 flow [2022-07-19 21:31:57,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 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-07-19 21:31:57,344 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:31:57,344 INFO L200 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:31:57,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 21:31:57,344 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:31:57,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:31:57,345 INFO L85 PathProgramCache]: Analyzing trace with hash 893041786, now seen corresponding path program 2 times [2022-07-19 21:31:57,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:31:57,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844274326] [2022-07-19 21:31:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:31:57,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:31:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:31:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-19 21:31:57,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:31:57,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844274326] [2022-07-19 21:31:57,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844274326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:31:57,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:31:57,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:31:57,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759763695] [2022-07-19 21:31:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:31:57,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:31:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:31:57,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:31:57,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:31:57,380 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 273 [2022-07-19 21:31:57,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 318 transitions, 1687 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-07-19 21:31:57,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:31:57,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 273 [2022-07-19 21:31:57,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:32:00,766 INFO L129 PetriNetUnfolder]: 4758/18179 cut-off events. [2022-07-19 21:32:00,767 INFO L130 PetriNetUnfolder]: For 152936/159691 co-relation queries the response was YES. [2022-07-19 21:32:00,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68192 conditions, 18179 events. 4758/18179 cut-off events. For 152936/159691 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 187317 event pairs, 1882 based on Foata normal form. 310/16119 useless extension candidates. Maximal degree in co-relation 68135. Up to 4754 conditions per place. [2022-07-19 21:32:01,061 INFO L132 encePairwiseOnDemand]: 268/273 looper letters, 67 selfloop transitions, 8 changer transitions 3/329 dead transitions. [2022-07-19 21:32:01,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 329 transitions, 2004 flow [2022-07-19 21:32:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:32:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:32:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 743 transitions. [2022-07-19 21:32:01,062 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9072039072039072 [2022-07-19 21:32:01,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 743 transitions. [2022-07-19 21:32:01,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 743 transitions. [2022-07-19 21:32:01,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:32:01,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 743 transitions. [2022-07-19 21:32:01,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-07-19 21:32:01,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:32:01,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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-07-19 21:32:01,064 INFO L186 Difference]: Start difference. First operand has 357 places, 318 transitions, 1687 flow. Second operand 3 states and 743 transitions. [2022-07-19 21:32:01,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 329 transitions, 2004 flow [2022-07-19 21:32:01,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 329 transitions, 1993 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-19 21:32:01,116 INFO L242 Difference]: Finished difference. Result has 356 places, 309 transitions, 1611 flow [2022-07-19 21:32:01,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1608, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1611, PETRI_PLACES=356, PETRI_TRANSITIONS=309} [2022-07-19 21:32:01,117 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 114 predicate places. [2022-07-19 21:32:01,117 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 309 transitions, 1611 flow [2022-07-19 21:32:01,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-07-19 21:32:01,117 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:32:01,117 INFO L200 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:32:01,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 21:32:01,117 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:32:01,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:32:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1294378901, now seen corresponding path program 1 times [2022-07-19 21:32:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:32:01,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72583243] [2022-07-19 21:32:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:32:01,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:32:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 21:32:01,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:32:01,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72583243] [2022-07-19 21:32:01,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72583243] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:32:01,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115630018] [2022-07-19 21:32:01,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:32:01,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:01,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:32:01,232 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-07-19 21:32:01,233 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-07-19 21:32:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:01,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 21:32:01,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:32:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 21:32:01,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:32:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 21:32:01,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115630018] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:32:01,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:32:01,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-07-19 21:32:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231142523] [2022-07-19 21:32:01,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:32:01,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 21:32:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:32:01,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 21:32:01,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:32:01,811 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 273 [2022-07-19 21:32:01,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 309 transitions, 1611 flow. Second operand has 19 states, 19 states have (on average 204.57894736842104) internal successors, (3887), 19 states have internal predecessors, (3887), 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-07-19 21:32:01,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:32:01,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 273 [2022-07-19 21:32:01,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:32:04,889 INFO L129 PetriNetUnfolder]: 2058/14282 cut-off events. [2022-07-19 21:32:04,889 INFO L130 PetriNetUnfolder]: For 69356/71667 co-relation queries the response was YES. [2022-07-19 21:32:04,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40996 conditions, 14282 events. 2058/14282 cut-off events. For 69356/71667 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 155839 event pairs, 852 based on Foata normal form. 24/13029 useless extension candidates. Maximal degree in co-relation 40939. Up to 3121 conditions per place. [2022-07-19 21:32:05,012 INFO L132 encePairwiseOnDemand]: 255/273 looper letters, 97 selfloop transitions, 35 changer transitions 51/371 dead transitions. [2022-07-19 21:32:05,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 371 transitions, 2482 flow [2022-07-19 21:32:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 21:32:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-19 21:32:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3299 transitions. [2022-07-19 21:32:05,014 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7552655677655677 [2022-07-19 21:32:05,014 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3299 transitions. [2022-07-19 21:32:05,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3299 transitions. [2022-07-19 21:32:05,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:32:05,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3299 transitions. [2022-07-19 21:32:05,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 206.1875) internal successors, (3299), 16 states have internal predecessors, (3299), 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-07-19 21:32:05,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 273.0) internal successors, (4641), 17 states have internal predecessors, (4641), 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-07-19 21:32:05,020 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 273.0) internal successors, (4641), 17 states have internal predecessors, (4641), 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-07-19 21:32:05,020 INFO L186 Difference]: Start difference. First operand has 356 places, 309 transitions, 1611 flow. Second operand 16 states and 3299 transitions. [2022-07-19 21:32:05,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 371 transitions, 2482 flow [2022-07-19 21:32:05,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 371 transitions, 2440 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-07-19 21:32:05,053 INFO L242 Difference]: Finished difference. Result has 370 places, 315 transitions, 1724 flow [2022-07-19 21:32:05,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1724, PETRI_PLACES=370, PETRI_TRANSITIONS=315} [2022-07-19 21:32:05,053 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 128 predicate places. [2022-07-19 21:32:05,053 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 315 transitions, 1724 flow [2022-07-19 21:32:05,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 204.57894736842104) internal successors, (3887), 19 states have internal predecessors, (3887), 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-07-19 21:32:05,054 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:32:05,054 INFO L200 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:32:05,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 21:32:05,267 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,SelfDestructingSolverStorable24 [2022-07-19 21:32:05,267 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:32:05,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:32:05,268 INFO L85 PathProgramCache]: Analyzing trace with hash 301853394, now seen corresponding path program 2 times [2022-07-19 21:32:05,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:32:05,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424487659] [2022-07-19 21:32:05,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:32:05,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:32:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-19 21:32:05,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:32:05,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424487659] [2022-07-19 21:32:05,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424487659] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:32:05,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927957691] [2022-07-19 21:32:05,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:32:05,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:05,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:32:05,889 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-07-19 21:32:05,890 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-07-19 21:32:06,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:32:06,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:32:06,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-19 21:32:06,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:32:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-19 21:32:06,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:32:06,736 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-19 21:32:06,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-07-19 21:32:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-19 21:32:07,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927957691] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:32:07,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:32:07,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15, 15] total 42 [2022-07-19 21:32:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597403837] [2022-07-19 21:32:07,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:32:07,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-19 21:32:07,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:32:07,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-19 21:32:07,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1487, Unknown=0, NotChecked=0, Total=1722 [2022-07-19 21:32:07,496 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 273 [2022-07-19 21:32:07,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 315 transitions, 1724 flow. Second operand has 42 states, 42 states have (on average 146.47619047619048) internal successors, (6152), 42 states have internal predecessors, (6152), 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-07-19 21:32:07,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:32:07,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 273 [2022-07-19 21:32:07,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:32:14,158 INFO L129 PetriNetUnfolder]: 4490/25080 cut-off events. [2022-07-19 21:32:14,158 INFO L130 PetriNetUnfolder]: For 142941/146867 co-relation queries the response was YES. [2022-07-19 21:32:14,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79663 conditions, 25080 events. 4490/25080 cut-off events. For 142941/146867 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 301730 event pairs, 984 based on Foata normal form. 70/23050 useless extension candidates. Maximal degree in co-relation 79601. Up to 4852 conditions per place. [2022-07-19 21:32:14,591 INFO L132 encePairwiseOnDemand]: 242/273 looper letters, 285 selfloop transitions, 62 changer transitions 31/508 dead transitions. [2022-07-19 21:32:14,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 508 transitions, 4134 flow [2022-07-19 21:32:14,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-19 21:32:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-07-19 21:32:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6158 transitions. [2022-07-19 21:32:14,596 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.53706610849468 [2022-07-19 21:32:14,596 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 6158 transitions. [2022-07-19 21:32:14,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 6158 transitions. [2022-07-19 21:32:14,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:32:14,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 6158 transitions. [2022-07-19 21:32:14,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 146.61904761904762) internal successors, (6158), 42 states have internal predecessors, (6158), 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-07-19 21:32:14,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 273.0) internal successors, (11739), 43 states have internal predecessors, (11739), 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-07-19 21:32:14,608 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 273.0) internal successors, (11739), 43 states have internal predecessors, (11739), 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-07-19 21:32:14,608 INFO L186 Difference]: Start difference. First operand has 370 places, 315 transitions, 1724 flow. Second operand 42 states and 6158 transitions. [2022-07-19 21:32:14,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 508 transitions, 4134 flow [2022-07-19 21:32:14,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 508 transitions, 4029 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-07-19 21:32:14,675 INFO L242 Difference]: Finished difference. Result has 413 places, 342 transitions, 2127 flow [2022-07-19 21:32:14,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1652, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=2127, PETRI_PLACES=413, PETRI_TRANSITIONS=342} [2022-07-19 21:32:14,676 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 171 predicate places. [2022-07-19 21:32:14,676 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 342 transitions, 2127 flow [2022-07-19 21:32:14,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 146.47619047619048) internal successors, (6152), 42 states have internal predecessors, (6152), 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-07-19 21:32:14,677 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:32:14,677 INFO L200 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:32:14,695 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-07-19 21:32:14,889 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,SelfDestructingSolverStorable25 [2022-07-19 21:32:14,889 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:32:14,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:32:14,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2031512626, now seen corresponding path program 3 times [2022-07-19 21:32:14,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:32:14,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419503428] [2022-07-19 21:32:14,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:32:14,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:32:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 31 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 21:32:15,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:32:15,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419503428] [2022-07-19 21:32:15,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419503428] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:32:15,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356454843] [2022-07-19 21:32:15,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:32:15,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:15,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:32:15,006 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-07-19 21:32:15,027 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-07-19 21:32:15,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 21:32:15,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:32:15,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 21:32:15,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:32:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 41 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 21:32:15,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:32:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 21:32:15,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356454843] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:32:15,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:32:15,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-07-19 21:32:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893764246] [2022-07-19 21:32:15,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:32:15,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 21:32:15,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:32:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 21:32:15,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-07-19 21:32:15,779 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 273 [2022-07-19 21:32:15,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 342 transitions, 2127 flow. Second operand has 28 states, 28 states have (on average 206.0) internal successors, (5768), 28 states have internal predecessors, (5768), 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-07-19 21:32:15,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:32:15,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 273 [2022-07-19 21:32:15,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:32:21,527 INFO L129 PetriNetUnfolder]: 3770/23867 cut-off events. [2022-07-19 21:32:21,527 INFO L130 PetriNetUnfolder]: For 139669/144190 co-relation queries the response was YES. [2022-07-19 21:32:21,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74427 conditions, 23867 events. 3770/23867 cut-off events. For 139669/144190 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 291551 event pairs, 1244 based on Foata normal form. 24/21649 useless extension candidates. Maximal degree in co-relation 74353. Up to 5585 conditions per place. [2022-07-19 21:32:21,837 INFO L132 encePairwiseOnDemand]: 249/273 looper letters, 100 selfloop transitions, 28 changer transitions 79/397 dead transitions. [2022-07-19 21:32:21,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 397 transitions, 2874 flow [2022-07-19 21:32:21,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 21:32:21,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-07-19 21:32:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4969 transitions. [2022-07-19 21:32:21,841 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7583943833943834 [2022-07-19 21:32:21,841 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4969 transitions. [2022-07-19 21:32:21,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4969 transitions. [2022-07-19 21:32:21,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:32:21,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4969 transitions. [2022-07-19 21:32:21,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 207.04166666666666) internal successors, (4969), 24 states have internal predecessors, (4969), 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-07-19 21:32:21,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 273.0) internal successors, (6825), 25 states have internal predecessors, (6825), 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-07-19 21:32:21,851 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 273.0) internal successors, (6825), 25 states have internal predecessors, (6825), 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-07-19 21:32:21,851 INFO L186 Difference]: Start difference. First operand has 413 places, 342 transitions, 2127 flow. Second operand 24 states and 4969 transitions. [2022-07-19 21:32:21,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 397 transitions, 2874 flow [2022-07-19 21:32:22,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 397 transitions, 2732 flow, removed 38 selfloop flow, removed 20 redundant places. [2022-07-19 21:32:22,015 INFO L242 Difference]: Finished difference. Result has 416 places, 313 transitions, 1797 flow [2022-07-19 21:32:22,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1797, PETRI_PLACES=416, PETRI_TRANSITIONS=313} [2022-07-19 21:32:22,016 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 174 predicate places. [2022-07-19 21:32:22,016 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 313 transitions, 1797 flow [2022-07-19 21:32:22,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 206.0) internal successors, (5768), 28 states have internal predecessors, (5768), 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-07-19 21:32:22,017 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:32:22,017 INFO L200 CegarLoopForPetriNet]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:32:22,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-19 21:32:22,217 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,SelfDestructingSolverStorable26 [2022-07-19 21:32:22,218 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:32:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:32:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2067473199, now seen corresponding path program 4 times [2022-07-19 21:32:22,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:32:22,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075301439] [2022-07-19 21:32:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:32:22,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:32:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 1 proven. 75 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 21:32:22,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:32:22,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075301439] [2022-07-19 21:32:22,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075301439] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:32:22,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237685209] [2022-07-19 21:32:22,830 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 21:32:22,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:22,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:32:22,831 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:32:22,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 21:32:23,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 21:32:23,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:32:23,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 21:32:23,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:32:24,139 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:32:24,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 3 [2022-07-19 21:32:24,144 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:32:24,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2022-07-19 21:32:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 21:32:24,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:32:24,281 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-19 21:32:24,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-07-19 21:32:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 21:32:26,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237685209] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:32:26,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:32:26,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 21] total 60 [2022-07-19 21:32:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624215062] [2022-07-19 21:32:26,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:32:26,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-19 21:32:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:32:26,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-19 21:32:26,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=3107, Unknown=0, NotChecked=0, Total=3540 [2022-07-19 21:32:26,316 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 273 [2022-07-19 21:32:26,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 313 transitions, 1797 flow. Second operand has 60 states, 60 states have (on average 137.21666666666667) internal successors, (8233), 60 states have internal predecessors, (8233), 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-07-19 21:32:26,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:32:26,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 273 [2022-07-19 21:32:26,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:32:42,233 INFO L129 PetriNetUnfolder]: 12083/52692 cut-off events. [2022-07-19 21:32:42,233 INFO L130 PetriNetUnfolder]: For 349918/358219 co-relation queries the response was YES. [2022-07-19 21:32:42,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173375 conditions, 52692 events. 12083/52692 cut-off events. For 349918/358219 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 677323 event pairs, 1286 based on Foata normal form. 319/47875 useless extension candidates. Maximal degree in co-relation 173302. Up to 10548 conditions per place. [2022-07-19 21:32:43,269 INFO L132 encePairwiseOnDemand]: 229/273 looper letters, 396 selfloop transitions, 132 changer transitions 69/718 dead transitions. [2022-07-19 21:32:43,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 718 transitions, 6218 flow [2022-07-19 21:32:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-19 21:32:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-07-19 21:32:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 7937 transitions. [2022-07-19 21:32:43,275 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5100571942677206 [2022-07-19 21:32:43,275 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 7937 transitions. [2022-07-19 21:32:43,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 7937 transitions. [2022-07-19 21:32:43,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:32:43,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 7937 transitions. [2022-07-19 21:32:43,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 139.24561403508773) internal successors, (7937), 57 states have internal predecessors, (7937), 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-07-19 21:32:43,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 273.0) internal successors, (15834), 58 states have internal predecessors, (15834), 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-07-19 21:32:43,304 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 273.0) internal successors, (15834), 58 states have internal predecessors, (15834), 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-07-19 21:32:43,305 INFO L186 Difference]: Start difference. First operand has 416 places, 313 transitions, 1797 flow. Second operand 57 states and 7937 transitions. [2022-07-19 21:32:43,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 718 transitions, 6218 flow [2022-07-19 21:32:43,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 718 transitions, 5936 flow, removed 58 selfloop flow, removed 30 redundant places. [2022-07-19 21:32:43,511 INFO L242 Difference]: Finished difference. Result has 450 places, 406 transitions, 3378 flow [2022-07-19 21:32:43,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=3378, PETRI_PLACES=450, PETRI_TRANSITIONS=406} [2022-07-19 21:32:43,512 INFO L279 CegarLoopForPetriNet]: 242 programPoint places, 208 predicate places. [2022-07-19 21:32:43,512 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 406 transitions, 3378 flow [2022-07-19 21:32:43,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 137.21666666666667) internal successors, (8233), 60 states have internal predecessors, (8233), 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-07-19 21:32:43,513 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:32:43,514 INFO L200 CegarLoopForPetriNet]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-19 21:32:43,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 21:32:43,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-19 21:32:43,717 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:32:43,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:32:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1481057497, now seen corresponding path program 5 times [2022-07-19 21:32:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:32:43,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376244811] [2022-07-19 21:32:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:32:43,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:32:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:32:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-19 21:32:44,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:32:44,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376244811] [2022-07-19 21:32:44,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376244811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:32:44,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640600383] [2022-07-19 21:32:44,274 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 21:32:44,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:32:44,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:32:44,275 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:32:44,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 21:32:44,473 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-19 21:32:44,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:32:44,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 21:32:44,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:32:45,567 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:32:45,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 3 [2022-07-19 21:32:45,572 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 21:32:45,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 1 [2022-07-19 21:32:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-19 21:32:45,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:32:45,687 INFO L356 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-07-19 21:32:45,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-07-19 21:32:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-19 21:32:47,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640600383] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:32:47,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:32:47,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 21] total 59 [2022-07-19 21:32:47,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572816653] [2022-07-19 21:32:47,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:32:47,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-19 21:32:47,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:32:47,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-19 21:32:47,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=3004, Unknown=0, NotChecked=0, Total=3422 [2022-07-19 21:32:47,703 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 273 [2022-07-19 21:32:47,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 406 transitions, 3378 flow. Second operand has 59 states, 59 states have (on average 145.77966101694915) internal successors, (8601), 59 states have internal predecessors, (8601), 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-07-19 21:32:47,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:32:47,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 273 [2022-07-19 21:32:47,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand