./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc --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 3a95f2ef87fd1cf5c8213f05c50508f1a1765fc5482d62813e9c15181aaf2ab6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:32:06,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:32:06,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:32:06,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:32:06,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:32:06,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:32:06,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:32:06,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:32:06,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:32:06,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:32:06,819 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:32:06,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:32:06,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:32:06,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:32:06,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:32:06,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:32:06,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:32:06,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:32:06,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:32:06,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:32:06,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:32:06,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:32:06,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:32:06,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:32:06,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:32:06,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:32:06,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:32:06,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:32:06,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:32:06,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:32:06,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:32:06,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:32:06,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:32:06,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:32:06,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:32:06,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:32:06,867 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:32:06,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:32:06,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:32:06,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:32:06,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:32:06,871 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:32:06,904 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:32:06,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:32:06,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:32:06,909 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:32:06,910 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:32:06,910 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:32:06,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:32:06,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:32:06,912 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:32:06,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:32:06,913 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:32:06,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:32:06,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:32:06,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:32:06,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:32:06,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:32:06,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:32:06,914 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:32:06,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:32:06,915 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:32:06,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:32:06,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:32:06,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:32:06,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:32:06,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:32:06,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:32:06,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:32:06,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:32:06,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:32:06,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:32:06,918 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:32:06,919 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:32:06,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:32:06,919 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc 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 -> 3a95f2ef87fd1cf5c8213f05c50508f1a1765fc5482d62813e9c15181aaf2ab6 [2022-11-02 20:32:07,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:32:07,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:32:07,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:32:07,191 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:32:07,192 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:32:07,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2022-11-02 20:32:07,257 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/data/d2fa5960d/44c61eec2fcb4453b88f70b0ae8dca27/FLAGab5eda0bc [2022-11-02 20:32:07,727 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:32:07,727 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2022-11-02 20:32:07,737 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/data/d2fa5960d/44c61eec2fcb4453b88f70b0ae8dca27/FLAGab5eda0bc [2022-11-02 20:32:08,141 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/data/d2fa5960d/44c61eec2fcb4453b88f70b0ae8dca27 [2022-11-02 20:32:08,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:32:08,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:32:08,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:32:08,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:32:08,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:32:08,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a43b00b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08, skipping insertion in model container [2022-11-02 20:32:08,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:32:08,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:32:08,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c[2761,2774] [2022-11-02 20:32:08,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:32:08,521 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:32:08,560 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c[2761,2774] [2022-11-02 20:32:08,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:32:08,589 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:32:08,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08 WrapperNode [2022-11-02 20:32:08,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:32:08,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:32:08,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:32:08,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:32:08,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,652 INFO L138 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 200 [2022-11-02 20:32:08,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:32:08,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:32:08,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:32:08,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:32:08,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,678 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:32:08,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:32:08,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:32:08,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:32:08,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (1/1) ... [2022-11-02 20:32:08,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:32:08,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:08,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:32:08,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:32:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:32:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:32:08,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:32:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:32:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:32:08,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:32:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:32:08,783 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:32:08,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:32:08,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:32:08,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:32:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:32:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:32:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:32:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:32:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:32:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:32:08,787 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:32:08,925 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:32:08,927 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:32:09,341 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:32:09,532 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:32:09,535 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:32:09,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:09 BoogieIcfgContainer [2022-11-02 20:32:09,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:32:09,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:32:09,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:32:09,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:32:09,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:32:08" (1/3) ... [2022-11-02 20:32:09,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3ef585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:09, skipping insertion in model container [2022-11-02 20:32:09,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:32:08" (2/3) ... [2022-11-02 20:32:09,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3ef585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:09, skipping insertion in model container [2022-11-02 20:32:09,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:09" (3/3) ... [2022-11-02 20:32:09,552 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2022-11-02 20:32:09,565 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:32:09,575 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:32:09,575 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:32:09,575 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:32:09,680 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:32:09,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 156 transitions, 336 flow [2022-11-02 20:32:09,820 INFO L130 PetriNetUnfolder]: 12/153 cut-off events. [2022-11-02 20:32:09,821 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:32:09,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 12/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 99 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 114. Up to 2 conditions per place. [2022-11-02 20:32:09,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 156 transitions, 336 flow [2022-11-02 20:32:09,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 142 transitions, 302 flow [2022-11-02 20:32:09,859 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:32:09,866 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@551510d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:32:09,866 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-02 20:32:09,901 INFO L130 PetriNetUnfolder]: 12/141 cut-off events. [2022-11-02 20:32:09,901 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:32:09,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:09,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:09,903 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-11-02 20:32:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash -227615430, now seen corresponding path program 1 times [2022-11-02 20:32:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:09,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531147949] [2022-11-02 20:32:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:09,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:10,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:10,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531147949] [2022-11-02 20:32:10,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531147949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:10,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:10,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:32:10,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163863076] [2022-11-02 20:32:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:10,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:32:10,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:10,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:32:10,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:32:10,288 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 156 [2022-11-02 20:32:10,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 142 transitions, 302 flow. Second operand has 2 states, 2 states have (on average 142.0) internal successors, (284), 2 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:10,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:10,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 156 [2022-11-02 20:32:10,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:10,406 INFO L130 PetriNetUnfolder]: 41/279 cut-off events. [2022-11-02 20:32:10,406 INFO L131 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-11-02 20:32:10,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 279 events. 41/279 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 814 event pairs, 15 based on Foata normal form. 39/288 useless extension candidates. Maximal degree in co-relation 229. Up to 59 conditions per place. [2022-11-02 20:32:10,414 INFO L137 encePairwiseOnDemand]: 148/156 looper letters, 9 selfloop transitions, 0 changer transitions 4/134 dead transitions. [2022-11-02 20:32:10,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 134 transitions, 304 flow [2022-11-02 20:32:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:32:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:32:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2022-11-02 20:32:10,435 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9391025641025641 [2022-11-02 20:32:10,436 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2022-11-02 20:32:10,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2022-11-02 20:32:10,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:10,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2022-11-02 20:32:10,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:10,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:10,457 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:10,459 INFO L175 Difference]: Start difference. First operand has 140 places, 142 transitions, 302 flow. Second operand 2 states and 293 transitions. [2022-11-02 20:32:10,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 134 transitions, 304 flow [2022-11-02 20:32:10,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 134 transitions, 292 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:32:10,469 INFO L231 Difference]: Finished difference. Result has 135 places, 130 transitions, 266 flow [2022-11-02 20:32:10,471 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=266, PETRI_PLACES=135, PETRI_TRANSITIONS=130} [2022-11-02 20:32:10,475 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, -5 predicate places. [2022-11-02 20:32:10,475 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 130 transitions, 266 flow [2022-11-02 20:32:10,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 142.0) internal successors, (284), 2 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:10,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:10,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:10,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:32:10,477 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-11-02 20:32:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:10,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1674272564, now seen corresponding path program 1 times [2022-11-02 20:32:10,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:10,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560319747] [2022-11-02 20:32:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:11,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:11,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560319747] [2022-11-02 20:32:11,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560319747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:11,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:11,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:32:11,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247602347] [2022-11-02 20:32:11,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:11,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:32:11,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:11,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:32:11,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:32:11,059 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 156 [2022-11-02 20:32:11,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 130 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:11,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:11,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 156 [2022-11-02 20:32:11,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:11,335 INFO L130 PetriNetUnfolder]: 175/636 cut-off events. [2022-11-02 20:32:11,335 INFO L131 PetriNetUnfolder]: For 39/40 co-relation queries the response was YES. [2022-11-02 20:32:11,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 636 events. 175/636 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3266 event pairs, 63 based on Foata normal form. 1/589 useless extension candidates. Maximal degree in co-relation 938. Up to 132 conditions per place. [2022-11-02 20:32:11,340 INFO L137 encePairwiseOnDemand]: 148/156 looper letters, 48 selfloop transitions, 6 changer transitions 4/158 dead transitions. [2022-11-02 20:32:11,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 158 transitions, 447 flow [2022-11-02 20:32:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:32:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:32:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2022-11-02 20:32:11,343 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7873931623931624 [2022-11-02 20:32:11,344 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2022-11-02 20:32:11,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2022-11-02 20:32:11,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:11,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2022-11-02 20:32:11,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:11,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 156.0) internal successors, (1092), 7 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-11-02 20:32:11,350 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 156.0) internal successors, (1092), 7 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-11-02 20:32:11,351 INFO L175 Difference]: Start difference. First operand has 135 places, 130 transitions, 266 flow. Second operand 6 states and 737 transitions. [2022-11-02 20:32:11,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 158 transitions, 447 flow [2022-11-02 20:32:11,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 158 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:32:11,355 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 302 flow [2022-11-02 20:32:11,356 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2022-11-02 20:32:11,357 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, -1 predicate places. [2022-11-02 20:32:11,357 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 302 flow [2022-11-02 20:32:11,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:11,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:11,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:11,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:32:11,359 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-11-02 20:32:11,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:11,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1399034336, now seen corresponding path program 1 times [2022-11-02 20:32:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:11,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577554906] [2022-11-02 20:32:11,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:11,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:11,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577554906] [2022-11-02 20:32:11,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577554906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:11,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:11,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:32:11,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418818783] [2022-11-02 20:32:11,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:11,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:32:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:11,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:32:11,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:32:11,603 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 156 [2022-11-02 20:32:11,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:11,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:11,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 156 [2022-11-02 20:32:11,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:12,062 INFO L130 PetriNetUnfolder]: 603/1708 cut-off events. [2022-11-02 20:32:12,062 INFO L131 PetriNetUnfolder]: For 77/83 co-relation queries the response was YES. [2022-11-02 20:32:12,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 1708 events. 603/1708 cut-off events. For 77/83 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11689 event pairs, 312 based on Foata normal form. 0/1472 useless extension candidates. Maximal degree in co-relation 2856. Up to 606 conditions per place. [2022-11-02 20:32:12,076 INFO L137 encePairwiseOnDemand]: 147/156 looper letters, 47 selfloop transitions, 8 changer transitions 0/158 dead transitions. [2022-11-02 20:32:12,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 158 transitions, 468 flow [2022-11-02 20:32:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:32:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-02 20:32:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 984 transitions. [2022-11-02 20:32:12,080 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7884615384615384 [2022-11-02 20:32:12,080 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 984 transitions. [2022-11-02 20:32:12,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 984 transitions. [2022-11-02 20:32:12,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:12,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 984 transitions. [2022-11-02 20:32:12,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:12,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 156.0) internal successors, (1404), 9 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:12,087 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 156.0) internal successors, (1404), 9 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:12,087 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 302 flow. Second operand 8 states and 984 transitions. [2022-11-02 20:32:12,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 158 transitions, 468 flow [2022-11-02 20:32:12,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 158 transitions, 464 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-02 20:32:12,092 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 334 flow [2022-11-02 20:32:12,092 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=334, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2022-11-02 20:32:12,093 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 5 predicate places. [2022-11-02 20:32:12,094 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 334 flow [2022-11-02 20:32:12,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:12,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:12,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:12,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:32:12,095 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-11-02 20:32:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1499400858, now seen corresponding path program 1 times [2022-11-02 20:32:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:12,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508616565] [2022-11-02 20:32:12,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:12,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:12,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508616565] [2022-11-02 20:32:12,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508616565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:12,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:12,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:32:12,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77639710] [2022-11-02 20:32:12,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:12,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:32:12,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:12,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:32:12,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:32:12,696 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 156 [2022-11-02 20:32:12,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 334 flow. Second operand has 10 states, 10 states have (on average 98.1) internal successors, (981), 10 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:12,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:12,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 156 [2022-11-02 20:32:12,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:13,677 INFO L130 PetriNetUnfolder]: 1151/2547 cut-off events. [2022-11-02 20:32:13,677 INFO L131 PetriNetUnfolder]: For 295/322 co-relation queries the response was YES. [2022-11-02 20:32:13,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4729 conditions, 2547 events. 1151/2547 cut-off events. For 295/322 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18638 event pairs, 890 based on Foata normal form. 27/2259 useless extension candidates. Maximal degree in co-relation 4720. Up to 1488 conditions per place. [2022-11-02 20:32:13,698 INFO L137 encePairwiseOnDemand]: 144/156 looper letters, 71 selfloop transitions, 11 changer transitions 0/168 dead transitions. [2022-11-02 20:32:13,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 168 transitions, 570 flow [2022-11-02 20:32:13,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:32:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:32:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1117 transitions. [2022-11-02 20:32:13,702 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6509324009324009 [2022-11-02 20:32:13,702 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1117 transitions. [2022-11-02 20:32:13,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1117 transitions. [2022-11-02 20:32:13,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:13,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1117 transitions. [2022-11-02 20:32:13,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.54545454545455) internal successors, (1117), 11 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:13,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 156.0) internal successors, (1872), 12 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:13,710 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 156.0) internal successors, (1872), 12 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:13,711 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 334 flow. Second operand 11 states and 1117 transitions. [2022-11-02 20:32:13,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 168 transitions, 570 flow [2022-11-02 20:32:13,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 168 transitions, 560 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:32:13,716 INFO L231 Difference]: Finished difference. Result has 156 places, 141 transitions, 373 flow [2022-11-02 20:32:13,717 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=373, PETRI_PLACES=156, PETRI_TRANSITIONS=141} [2022-11-02 20:32:13,717 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 16 predicate places. [2022-11-02 20:32:13,718 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 141 transitions, 373 flow [2022-11-02 20:32:13,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.1) internal successors, (981), 10 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:13,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:13,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:13,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:32:13,719 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-11-02 20:32:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash -911657420, now seen corresponding path program 1 times [2022-11-02 20:32:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:13,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018453837] [2022-11-02 20:32:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:14,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:14,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018453837] [2022-11-02 20:32:14,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018453837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:14,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:14,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:32:14,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352707436] [2022-11-02 20:32:14,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:14,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:32:14,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:14,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:32:14,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:32:14,167 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 156 [2022-11-02 20:32:14,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 141 transitions, 373 flow. Second operand has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:14,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:14,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 156 [2022-11-02 20:32:14,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:15,037 INFO L130 PetriNetUnfolder]: 957/2002 cut-off events. [2022-11-02 20:32:15,037 INFO L131 PetriNetUnfolder]: For 426/444 co-relation queries the response was YES. [2022-11-02 20:32:15,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3964 conditions, 2002 events. 957/2002 cut-off events. For 426/444 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13078 event pairs, 551 based on Foata normal form. 18/1826 useless extension candidates. Maximal degree in co-relation 3950. Up to 1109 conditions per place. [2022-11-02 20:32:15,054 INFO L137 encePairwiseOnDemand]: 143/156 looper letters, 53 selfloop transitions, 7 changer transitions 21/167 dead transitions. [2022-11-02 20:32:15,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 167 transitions, 597 flow [2022-11-02 20:32:15,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:32:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-02 20:32:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1220 transitions. [2022-11-02 20:32:15,058 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6517094017094017 [2022-11-02 20:32:15,058 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1220 transitions. [2022-11-02 20:32:15,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1220 transitions. [2022-11-02 20:32:15,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:15,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1220 transitions. [2022-11-02 20:32:15,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 101.66666666666667) internal successors, (1220), 12 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:15,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 156.0) internal successors, (2028), 13 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:15,067 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 156.0) internal successors, (2028), 13 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:15,067 INFO L175 Difference]: Start difference. First operand has 156 places, 141 transitions, 373 flow. Second operand 12 states and 1220 transitions. [2022-11-02 20:32:15,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 167 transitions, 597 flow [2022-11-02 20:32:15,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 167 transitions, 584 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:32:15,074 INFO L231 Difference]: Finished difference. Result has 164 places, 135 transitions, 340 flow [2022-11-02 20:32:15,074 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=340, PETRI_PLACES=164, PETRI_TRANSITIONS=135} [2022-11-02 20:32:15,077 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 24 predicate places. [2022-11-02 20:32:15,077 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 135 transitions, 340 flow [2022-11-02 20:32:15,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:15,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:15,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:15,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:32:15,079 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-11-02 20:32:15,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:15,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1924719290, now seen corresponding path program 1 times [2022-11-02 20:32:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:15,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34557503] [2022-11-02 20:32:15,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:15,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:15,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:15,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34557503] [2022-11-02 20:32:15,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34557503] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:15,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137363088] [2022-11-02 20:32:15,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:15,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:15,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:15,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:15,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:32:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:15,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:32:15,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:15,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:32:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:15,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137363088] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:15,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:32:15,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-02 20:32:15,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045754475] [2022-11-02 20:32:15,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:15,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:32:15,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:15,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:32:15,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:32:15,953 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 156 [2022-11-02 20:32:15,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 135 transitions, 340 flow. Second operand has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:15,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:15,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 156 [2022-11-02 20:32:15,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:16,769 INFO L130 PetriNetUnfolder]: 1766/3399 cut-off events. [2022-11-02 20:32:16,769 INFO L131 PetriNetUnfolder]: For 946/946 co-relation queries the response was YES. [2022-11-02 20:32:16,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7396 conditions, 3399 events. 1766/3399 cut-off events. For 946/946 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 24996 event pairs, 441 based on Foata normal form. 11/3327 useless extension candidates. Maximal degree in co-relation 7380. Up to 793 conditions per place. [2022-11-02 20:32:16,840 INFO L137 encePairwiseOnDemand]: 145/156 looper letters, 78 selfloop transitions, 17 changer transitions 0/191 dead transitions. [2022-11-02 20:32:16,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 191 transitions, 685 flow [2022-11-02 20:32:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:32:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:32:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1294 transitions. [2022-11-02 20:32:16,845 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.754079254079254 [2022-11-02 20:32:16,845 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1294 transitions. [2022-11-02 20:32:16,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1294 transitions. [2022-11-02 20:32:16,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:16,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1294 transitions. [2022-11-02 20:32:16,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.63636363636364) internal successors, (1294), 11 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:16,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 156.0) internal successors, (1872), 12 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:16,855 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 156.0) internal successors, (1872), 12 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:16,856 INFO L175 Difference]: Start difference. First operand has 164 places, 135 transitions, 340 flow. Second operand 11 states and 1294 transitions. [2022-11-02 20:32:16,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 191 transitions, 685 flow [2022-11-02 20:32:16,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 191 transitions, 624 flow, removed 23 selfloop flow, removed 14 redundant places. [2022-11-02 20:32:16,873 INFO L231 Difference]: Finished difference. Result has 153 places, 147 transitions, 403 flow [2022-11-02 20:32:16,874 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=403, PETRI_PLACES=153, PETRI_TRANSITIONS=147} [2022-11-02 20:32:16,876 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 13 predicate places. [2022-11-02 20:32:16,878 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 147 transitions, 403 flow [2022-11-02 20:32:16,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:16,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:16,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:16,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:32:17,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:17,091 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-11-02 20:32:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:17,092 INFO L85 PathProgramCache]: Analyzing trace with hash -395270040, now seen corresponding path program 2 times [2022-11-02 20:32:17,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:17,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960321738] [2022-11-02 20:32:17,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:17,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:17,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:17,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960321738] [2022-11-02 20:32:17,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960321738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:17,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418354188] [2022-11-02 20:32:17,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:32:17,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:17,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:17,375 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:17,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:32:17,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:32:17,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:32:17,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:32:17,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:17,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:32:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:17,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418354188] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:17,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:32:17,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-02 20:32:17,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949746237] [2022-11-02 20:32:17,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:17,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:32:17,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:17,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:32:17,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:32:17,935 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 156 [2022-11-02 20:32:17,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 147 transitions, 403 flow. Second operand has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:17,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:17,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 156 [2022-11-02 20:32:17,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:18,826 INFO L130 PetriNetUnfolder]: 1970/4147 cut-off events. [2022-11-02 20:32:18,826 INFO L131 PetriNetUnfolder]: For 1743/1763 co-relation queries the response was YES. [2022-11-02 20:32:18,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9472 conditions, 4147 events. 1970/4147 cut-off events. For 1743/1763 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 32436 event pairs, 357 based on Foata normal form. 9/3851 useless extension candidates. Maximal degree in co-relation 9460. Up to 834 conditions per place. [2022-11-02 20:32:18,859 INFO L137 encePairwiseOnDemand]: 144/156 looper letters, 77 selfloop transitions, 30 changer transitions 0/203 dead transitions. [2022-11-02 20:32:18,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 203 transitions, 813 flow [2022-11-02 20:32:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:32:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:32:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1286 transitions. [2022-11-02 20:32:18,864 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7494172494172494 [2022-11-02 20:32:18,864 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1286 transitions. [2022-11-02 20:32:18,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1286 transitions. [2022-11-02 20:32:18,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:18,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1286 transitions. [2022-11-02 20:32:18,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.9090909090909) internal successors, (1286), 11 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:18,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 156.0) internal successors, (1872), 12 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:18,872 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 156.0) internal successors, (1872), 12 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:18,873 INFO L175 Difference]: Start difference. First operand has 153 places, 147 transitions, 403 flow. Second operand 11 states and 1286 transitions. [2022-11-02 20:32:18,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 203 transitions, 813 flow [2022-11-02 20:32:18,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 203 transitions, 808 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:32:18,895 INFO L231 Difference]: Finished difference. Result has 166 places, 165 transitions, 614 flow [2022-11-02 20:32:18,896 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=614, PETRI_PLACES=166, PETRI_TRANSITIONS=165} [2022-11-02 20:32:18,896 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 26 predicate places. [2022-11-02 20:32:18,897 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 165 transitions, 614 flow [2022-11-02 20:32:18,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:18,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:18,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:18,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:32:19,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:19,120 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-11-02 20:32:19,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash -702548744, now seen corresponding path program 3 times [2022-11-02 20:32:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:19,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924865922] [2022-11-02 20:32:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:19,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:19,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924865922] [2022-11-02 20:32:19,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924865922] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:19,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136563542] [2022-11-02 20:32:19,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:32:19,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:19,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:19,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:19,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:32:19,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-02 20:32:19,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:32:19,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:32:19,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:19,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:32:19,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:19,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136563542] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:19,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:32:19,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-11-02 20:32:19,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880135907] [2022-11-02 20:32:19,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:19,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:32:19,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:19,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:32:19,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:32:19,923 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 156 [2022-11-02 20:32:19,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 165 transitions, 614 flow. Second operand has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:19,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:19,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 156 [2022-11-02 20:32:19,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:21,174 INFO L130 PetriNetUnfolder]: 2477/5212 cut-off events. [2022-11-02 20:32:21,175 INFO L131 PetriNetUnfolder]: For 8046/8182 co-relation queries the response was YES. [2022-11-02 20:32:21,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14957 conditions, 5212 events. 2477/5212 cut-off events. For 8046/8182 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 42677 event pairs, 493 based on Foata normal form. 81/4911 useless extension candidates. Maximal degree in co-relation 14939. Up to 973 conditions per place. [2022-11-02 20:32:21,239 INFO L137 encePairwiseOnDemand]: 143/156 looper letters, 93 selfloop transitions, 47 changer transitions 0/236 dead transitions. [2022-11-02 20:32:21,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 236 transitions, 1234 flow [2022-11-02 20:32:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:32:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:32:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1305 transitions. [2022-11-02 20:32:21,244 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7604895104895105 [2022-11-02 20:32:21,244 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1305 transitions. [2022-11-02 20:32:21,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1305 transitions. [2022-11-02 20:32:21,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:21,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1305 transitions. [2022-11-02 20:32:21,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.63636363636364) internal successors, (1305), 11 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:21,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 156.0) internal successors, (1872), 12 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:21,253 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 156.0) internal successors, (1872), 12 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:21,254 INFO L175 Difference]: Start difference. First operand has 166 places, 165 transitions, 614 flow. Second operand 11 states and 1305 transitions. [2022-11-02 20:32:21,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 236 transitions, 1234 flow [2022-11-02 20:32:21,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 236 transitions, 1205 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-11-02 20:32:21,378 INFO L231 Difference]: Finished difference. Result has 177 places, 185 transitions, 942 flow [2022-11-02 20:32:21,379 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=942, PETRI_PLACES=177, PETRI_TRANSITIONS=185} [2022-11-02 20:32:21,379 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 37 predicate places. [2022-11-02 20:32:21,380 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 185 transitions, 942 flow [2022-11-02 20:32:21,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:21,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:21,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:21,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-02 20:32:21,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:32:21,587 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-11-02 20:32:21,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash -530669304, now seen corresponding path program 4 times [2022-11-02 20:32:21,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:21,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084748764] [2022-11-02 20:32:21,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:21,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:21,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:21,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084748764] [2022-11-02 20:32:21,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084748764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:21,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14320799] [2022-11-02 20:32:21,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:32:21,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:21,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:21,837 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:21,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:32:21,947 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:32:21,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:32:21,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:32:21,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:22,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:32:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:22,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14320799] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:22,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:32:22,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-11-02 20:32:22,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331458309] [2022-11-02 20:32:22,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:22,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:32:22,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:22,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:32:22,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:32:22,440 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 156 [2022-11-02 20:32:22,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 185 transitions, 942 flow. Second operand has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:22,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:22,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 156 [2022-11-02 20:32:22,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:23,768 INFO L130 PetriNetUnfolder]: 2574/5377 cut-off events. [2022-11-02 20:32:23,768 INFO L131 PetriNetUnfolder]: For 14942/15182 co-relation queries the response was YES. [2022-11-02 20:32:23,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17777 conditions, 5377 events. 2574/5377 cut-off events. For 14942/15182 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 44039 event pairs, 387 based on Foata normal form. 29/5029 useless extension candidates. Maximal degree in co-relation 17754. Up to 1438 conditions per place. [2022-11-02 20:32:23,820 INFO L137 encePairwiseOnDemand]: 143/156 looper letters, 83 selfloop transitions, 47 changer transitions 0/226 dead transitions. [2022-11-02 20:32:23,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 226 transitions, 1398 flow [2022-11-02 20:32:23,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:32:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:32:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1179 transitions. [2022-11-02 20:32:23,824 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7557692307692307 [2022-11-02 20:32:23,824 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1179 transitions. [2022-11-02 20:32:23,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1179 transitions. [2022-11-02 20:32:23,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:23,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1179 transitions. [2022-11-02 20:32:23,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.9) internal successors, (1179), 10 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:23,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 156.0) internal successors, (1716), 11 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:23,831 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 156.0) internal successors, (1716), 11 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:23,831 INFO L175 Difference]: Start difference. First operand has 177 places, 185 transitions, 942 flow. Second operand 10 states and 1179 transitions. [2022-11-02 20:32:23,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 226 transitions, 1398 flow [2022-11-02 20:32:23,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 226 transitions, 1347 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-11-02 20:32:23,935 INFO L231 Difference]: Finished difference. Result has 183 places, 192 transitions, 1135 flow [2022-11-02 20:32:23,935 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1135, PETRI_PLACES=183, PETRI_TRANSITIONS=192} [2022-11-02 20:32:23,936 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 43 predicate places. [2022-11-02 20:32:23,936 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 192 transitions, 1135 flow [2022-11-02 20:32:23,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:23,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:23,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:23,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-02 20:32:24,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:24,162 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-11-02 20:32:24,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash -669176570, now seen corresponding path program 5 times [2022-11-02 20:32:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:24,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899529627] [2022-11-02 20:32:24,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:24,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:24,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899529627] [2022-11-02 20:32:24,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899529627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:24,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549547233] [2022-11-02 20:32:24,449 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:32:24,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:24,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:24,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:24,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:32:24,577 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:32:24,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:32:24,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:32:24,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:24,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:32:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:24,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549547233] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:32:24,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:32:24,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-11-02 20:32:24,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621288531] [2022-11-02 20:32:24,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:32:24,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:32:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:24,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:32:24,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:32:24,749 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 156 [2022-11-02 20:32:24,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 192 transitions, 1135 flow. Second operand has 17 states, 17 states have (on average 109.47058823529412) internal successors, (1861), 17 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:24,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:24,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 156 [2022-11-02 20:32:24,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:27,456 INFO L130 PetriNetUnfolder]: 5084/9950 cut-off events. [2022-11-02 20:32:27,456 INFO L131 PetriNetUnfolder]: For 35415/35761 co-relation queries the response was YES. [2022-11-02 20:32:27,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34195 conditions, 9950 events. 5084/9950 cut-off events. For 35415/35761 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 83789 event pairs, 531 based on Foata normal form. 45/9485 useless extension candidates. Maximal degree in co-relation 34169. Up to 1065 conditions per place. [2022-11-02 20:32:27,564 INFO L137 encePairwiseOnDemand]: 140/156 looper letters, 237 selfloop transitions, 142 changer transitions 0/472 dead transitions. [2022-11-02 20:32:27,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 472 transitions, 3741 flow [2022-11-02 20:32:27,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:32:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-11-02 20:32:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2829 transitions. [2022-11-02 20:32:27,573 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7556089743589743 [2022-11-02 20:32:27,573 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2829 transitions. [2022-11-02 20:32:27,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2829 transitions. [2022-11-02 20:32:27,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:27,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2829 transitions. [2022-11-02 20:32:27,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 117.875) internal successors, (2829), 24 states have internal predecessors, (2829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:27,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 156.0) internal successors, (3900), 25 states have internal predecessors, (3900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:27,591 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 156.0) internal successors, (3900), 25 states have internal predecessors, (3900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:27,591 INFO L175 Difference]: Start difference. First operand has 183 places, 192 transitions, 1135 flow. Second operand 24 states and 2829 transitions. [2022-11-02 20:32:27,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 472 transitions, 3741 flow [2022-11-02 20:32:27,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 472 transitions, 3578 flow, removed 30 selfloop flow, removed 6 redundant places. [2022-11-02 20:32:27,880 INFO L231 Difference]: Finished difference. Result has 218 places, 294 transitions, 2746 flow [2022-11-02 20:32:27,881 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2746, PETRI_PLACES=218, PETRI_TRANSITIONS=294} [2022-11-02 20:32:27,882 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 78 predicate places. [2022-11-02 20:32:27,882 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 294 transitions, 2746 flow [2022-11-02 20:32:27,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 109.47058823529412) internal successors, (1861), 17 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:27,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:27,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:27,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:32:28,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:32:28,098 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-11-02 20:32:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1851919884, now seen corresponding path program 1 times [2022-11-02 20:32:28,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:28,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747330025] [2022-11-02 20:32:28,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:28,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:28,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:28,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747330025] [2022-11-02 20:32:28,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747330025] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:28,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342539026] [2022-11-02 20:32:28,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:28,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:28,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:28,380 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:28,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:32:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:28,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:32:28,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:28,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:32:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:28,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342539026] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:28,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:32:28,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-02 20:32:28,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408309491] [2022-11-02 20:32:28,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:28,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:32:28,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:28,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:32:28,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:32:28,818 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 156 [2022-11-02 20:32:28,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 294 transitions, 2746 flow. Second operand has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:28,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:28,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 156 [2022-11-02 20:32:28,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:29,788 INFO L130 PetriNetUnfolder]: 1968/4689 cut-off events. [2022-11-02 20:32:29,788 INFO L131 PetriNetUnfolder]: For 33391/34096 co-relation queries the response was YES. [2022-11-02 20:32:29,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17624 conditions, 4689 events. 1968/4689 cut-off events. For 33391/34096 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 39618 event pairs, 491 based on Foata normal form. 312/4752 useless extension candidates. Maximal degree in co-relation 17581. Up to 1504 conditions per place. [2022-11-02 20:32:29,864 INFO L137 encePairwiseOnDemand]: 148/156 looper letters, 103 selfloop transitions, 24 changer transitions 0/331 dead transitions. [2022-11-02 20:32:29,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 331 transitions, 3479 flow [2022-11-02 20:32:29,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:32:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:32:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 852 transitions. [2022-11-02 20:32:29,868 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7802197802197802 [2022-11-02 20:32:29,868 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 852 transitions. [2022-11-02 20:32:29,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 852 transitions. [2022-11-02 20:32:29,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:29,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 852 transitions. [2022-11-02 20:32:29,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:29,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:29,874 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:29,874 INFO L175 Difference]: Start difference. First operand has 218 places, 294 transitions, 2746 flow. Second operand 7 states and 852 transitions. [2022-11-02 20:32:29,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 331 transitions, 3479 flow [2022-11-02 20:32:30,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 331 transitions, 3339 flow, removed 33 selfloop flow, removed 9 redundant places. [2022-11-02 20:32:30,054 INFO L231 Difference]: Finished difference. Result has 216 places, 294 transitions, 2670 flow [2022-11-02 20:32:30,054 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=2597, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2670, PETRI_PLACES=216, PETRI_TRANSITIONS=294} [2022-11-02 20:32:30,055 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 76 predicate places. [2022-11-02 20:32:30,055 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 294 transitions, 2670 flow [2022-11-02 20:32:30,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:30,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:30,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:30,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-02 20:32:30,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:32:30,266 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-11-02 20:32:30,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:30,267 INFO L85 PathProgramCache]: Analyzing trace with hash -692239788, now seen corresponding path program 6 times [2022-11-02 20:32:30,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:30,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056386815] [2022-11-02 20:32:30,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:30,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:30,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:30,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056386815] [2022-11-02 20:32:30,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056386815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:30,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541634579] [2022-11-02 20:32:30,516 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 20:32:30,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:30,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:30,518 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:30,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:32:30,653 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-11-02 20:32:30,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:32:30,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:32:30,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:30,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:32:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:32:31,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541634579] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:31,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:32:31,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2022-11-02 20:32:31,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791657501] [2022-11-02 20:32:31,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:31,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:32:31,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:32:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:32:31,132 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 156 [2022-11-02 20:32:31,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 294 transitions, 2670 flow. Second operand has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:31,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:31,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 156 [2022-11-02 20:32:31,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:32,625 INFO L130 PetriNetUnfolder]: 3128/6453 cut-off events. [2022-11-02 20:32:32,625 INFO L131 PetriNetUnfolder]: For 33699/34002 co-relation queries the response was YES. [2022-11-02 20:32:32,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25150 conditions, 6453 events. 3128/6453 cut-off events. For 33699/34002 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 52024 event pairs, 437 based on Foata normal form. 69/6412 useless extension candidates. Maximal degree in co-relation 25110. Up to 1952 conditions per place. [2022-11-02 20:32:32,719 INFO L137 encePairwiseOnDemand]: 144/156 looper letters, 100 selfloop transitions, 118 changer transitions 0/331 dead transitions. [2022-11-02 20:32:32,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 331 transitions, 3271 flow [2022-11-02 20:32:32,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:32:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:32:32,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1175 transitions. [2022-11-02 20:32:32,723 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7532051282051282 [2022-11-02 20:32:32,723 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1175 transitions. [2022-11-02 20:32:32,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1175 transitions. [2022-11-02 20:32:32,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:32,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1175 transitions. [2022-11-02 20:32:32,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.5) internal successors, (1175), 10 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:32,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 156.0) internal successors, (1716), 11 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:32,732 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 156.0) internal successors, (1716), 11 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:32,732 INFO L175 Difference]: Start difference. First operand has 216 places, 294 transitions, 2670 flow. Second operand 10 states and 1175 transitions. [2022-11-02 20:32:32,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 331 transitions, 3271 flow [2022-11-02 20:32:33,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 331 transitions, 3240 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:32:33,028 INFO L231 Difference]: Finished difference. Result has 223 places, 296 transitions, 3074 flow [2022-11-02 20:32:33,029 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=2643, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3074, PETRI_PLACES=223, PETRI_TRANSITIONS=296} [2022-11-02 20:32:33,029 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 83 predicate places. [2022-11-02 20:32:33,030 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 296 transitions, 3074 flow [2022-11-02 20:32:33,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:33,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:32:33,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:32:33,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:32:33,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:33,246 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-11-02 20:32:33,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:33,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1579631014, now seen corresponding path program 1 times [2022-11-02 20:32:33,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:33,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996287464] [2022-11-02 20:32:33,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:34,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:34,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996287464] [2022-11-02 20:32:34,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996287464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:32:34,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429108706] [2022-11-02 20:32:34,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:34,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:32:34,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:32:34,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:32:35,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:32:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-02 20:32:35,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:32:35,220 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-11-02 20:32:35,288 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:32:35,289 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:32:35,828 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:32:35,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:32:36,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-11-02 20:32:36,967 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-11-02 20:32:37,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-11-02 20:32:37,344 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-11-02 20:32:37,618 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:32:37,619 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 17 [2022-11-02 20:32:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:37,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:32:38,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_333 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))))) is different from false [2022-11-02 20:32:38,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) is different from false [2022-11-02 20:32:38,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-11-02 20:32:38,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-11-02 20:32:39,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))))) is different from false [2022-11-02 20:32:39,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) is different from false [2022-11-02 20:32:39,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))))) is different from false [2022-11-02 20:32:39,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:32:39,457 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-11-02 20:32:39,472 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:32:39,472 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 384 [2022-11-02 20:32:39,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:32:39,489 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 374 treesize of output 320 [2022-11-02 20:32:39,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:32:39,505 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 310 treesize of output 288 [2022-11-02 20:32:39,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:32:39,522 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 278 treesize of output 272 [2022-11-02 20:32:40,952 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:32:40,953 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 22 treesize of output 18 [2022-11-02 20:32:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:32:40,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429108706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:32:40,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:32:40,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 32] total 77 [2022-11-02 20:32:40,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633386061] [2022-11-02 20:32:40,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:32:40,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-02 20:32:40,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:40,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-02 20:32:40,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=4204, Unknown=10, NotChecked=994, Total=5852 [2022-11-02 20:32:40,979 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 156 [2022-11-02 20:32:40,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 296 transitions, 3074 flow. Second operand has 77 states, 77 states have (on average 61.36363636363637) internal successors, (4725), 77 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:40,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:32:40,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 156 [2022-11-02 20:32:40,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:32:52,244 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L61-->L63: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#res#1_1|)) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| |v_thread2Thread1of1ForFork1_plus_~a#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| v_~res2~0_33) (= (select (select |v_#memory_int_45| v_~A~0.base_34) (+ v_~A~0.offset_34 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_plus_#in~b#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)))) InVars {#memory_int=|v_#memory_int_45|, ~A~0.base=v_~A~0.base_34, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~res2~0=v_~res2~0_33} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.base=v_~A~0.base_34, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_1|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_1|, #memory_int=|v_#memory_int_45|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_1|, ~res2~0=v_~res2~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1][126], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 18#L73-2true, 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 91#L53true, Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 2465#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 124#L63true, Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 90#L98-4true, Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), Black: 4007#(<= 1 ~N~0), 160#true, 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-02 20:32:52,244 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is cut-off event [2022-11-02 20:32:52,245 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:32:52,245 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:32:52,245 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 20:32:52,877 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([593] L73-2-->L73-3: Formula: (= (+ |v_thread3Thread1of1ForFork2_#t~post7#1_3| 1) |v_thread3Thread1of1ForFork2_~i~2#1_11|) InVars {thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|} OutVars{thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1][729], [Black: 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, 91#L53true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3208#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 109#L61true, Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 90#L98-4true, Black: 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 39#L73-3true, Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 2482#(<= 1 ~N~0), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 1719#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), Black: 4007#(<= 1 ~N~0), 5452#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 160#true, 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-02 20:32:52,877 INFO L383 tUnfolder$Statistics]: this new event has 100 ancestors and is not cut-off event [2022-11-02 20:32:52,877 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is not cut-off event [2022-11-02 20:32:52,877 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is not cut-off event [2022-11-02 20:32:52,878 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is not cut-off event [2022-11-02 20:32:52,920 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([571] L47-2-->L47-3: Formula: (= (+ |v_thread1Thread1of1ForFork0_#t~post1#1_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_11|) InVars {thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1][414], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 18#L73-2true, 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 109#L61true, Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 95#L47-3true, 2465#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 90#L98-4true, Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 3961#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 4007#(<= 1 ~N~0), Black: 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 160#true, 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)))]) [2022-11-02 20:32:52,920 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-02 20:32:52,921 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:32:52,921 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:32:52,921 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:32:52,921 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L61-->L63: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#res#1_1|)) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| |v_thread2Thread1of1ForFork1_plus_~a#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| v_~res2~0_33) (= (select (select |v_#memory_int_45| v_~A~0.base_34) (+ v_~A~0.offset_34 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_plus_#in~b#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)))) InVars {#memory_int=|v_#memory_int_45|, ~A~0.base=v_~A~0.base_34, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~res2~0=v_~res2~0_33} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.base=v_~A~0.base_34, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_1|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_1|, #memory_int=|v_#memory_int_45|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_1|, ~res2~0=v_~res2~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1][126], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 18#L73-2true, 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 2465#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 124#L63true, Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 90#L98-4true, Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 136#L47-2true, Black: 4007#(<= 1 ~N~0), 160#true, 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-02 20:32:52,922 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-02 20:32:52,922 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:32:52,922 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:32:52,923 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 20:32:53,434 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([593] L73-2-->L73-3: Formula: (= (+ |v_thread3Thread1of1ForFork2_#t~post7#1_3| 1) |v_thread3Thread1of1ForFork2_~i~2#1_11|) InVars {thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|} OutVars{thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1][729], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3208#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 109#L61true, Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 90#L98-4true, Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 39#L73-3true, Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 2482#(<= 1 ~N~0), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 1719#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 136#L47-2true, Black: 4007#(<= 1 ~N~0), 5452#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 160#true, 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-02 20:32:53,435 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is not cut-off event [2022-11-02 20:32:53,435 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is not cut-off event [2022-11-02 20:32:53,435 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is not cut-off event [2022-11-02 20:32:53,435 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is not cut-off event [2022-11-02 20:32:54,031 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L61-->L63: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#res#1_1|)) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| |v_thread2Thread1of1ForFork1_plus_~a#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| v_~res2~0_33) (= (select (select |v_#memory_int_45| v_~A~0.base_34) (+ v_~A~0.offset_34 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_plus_#in~b#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)))) InVars {#memory_int=|v_#memory_int_45|, ~A~0.base=v_~A~0.base_34, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~res2~0=v_~res2~0_33} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.base=v_~A~0.base_34, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_1|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_1|, #memory_int=|v_#memory_int_45|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_1|, ~res2~0=v_~res2~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1][126], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 18#L73-2true, 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 91#L53true, Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 2465#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 51#L99-1true, Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 124#L63true, Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), Black: 4007#(<= 1 ~N~0), 160#true, 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-02 20:32:54,031 INFO L383 tUnfolder$Statistics]: this new event has 103 ancestors and is cut-off event [2022-11-02 20:32:54,031 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-11-02 20:32:54,031 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-11-02 20:32:54,031 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2022-11-02 20:32:54,303 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([593] L73-2-->L73-3: Formula: (= (+ |v_thread3Thread1of1ForFork2_#t~post7#1_3| 1) |v_thread3Thread1of1ForFork2_~i~2#1_11|) InVars {thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|} OutVars{thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1][729], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 91#L53true, Black: 3208#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 109#L61true, Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 51#L99-1true, Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 39#L73-3true, Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 2482#(<= 1 ~N~0), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 1719#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), Black: 4007#(<= 1 ~N~0), 5452#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 160#true, 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-02 20:32:54,303 INFO L383 tUnfolder$Statistics]: this new event has 103 ancestors and is not cut-off event [2022-11-02 20:32:54,304 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is not cut-off event [2022-11-02 20:32:54,304 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is not cut-off event [2022-11-02 20:32:54,304 INFO L386 tUnfolder$Statistics]: existing Event has 103 ancestors and is not cut-off event [2022-11-02 20:32:54,324 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([571] L47-2-->L47-3: Formula: (= (+ |v_thread1Thread1of1ForFork0_#t~post1#1_3| 1) |v_thread1Thread1of1ForFork0_~i~0#1_11|) InVars {thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post1#1=|v_thread1Thread1of1ForFork0_#t~post1#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1][414], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 18#L73-2true, 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 109#L61true, Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 95#L47-3true, 2465#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 51#L99-1true, Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 3961#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 4007#(<= 1 ~N~0), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 160#true, 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)))]) [2022-11-02 20:32:54,324 INFO L383 tUnfolder$Statistics]: this new event has 104 ancestors and is cut-off event [2022-11-02 20:32:54,324 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-11-02 20:32:54,324 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-11-02 20:32:54,324 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-11-02 20:32:54,324 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L61-->L63: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#res#1_1|)) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| |v_thread2Thread1of1ForFork1_plus_~a#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| v_~res2~0_33) (= (select (select |v_#memory_int_45| v_~A~0.base_34) (+ v_~A~0.offset_34 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_plus_#in~b#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)))) InVars {#memory_int=|v_#memory_int_45|, ~A~0.base=v_~A~0.base_34, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~res2~0=v_~res2~0_33} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.base=v_~A~0.base_34, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_1|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_1|, #memory_int=|v_#memory_int_45|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_1|, ~res2~0=v_~res2~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1][126], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 18#L73-2true, 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 2465#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 51#L99-1true, Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 124#L63true, Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 136#L47-2true, Black: 4007#(<= 1 ~N~0), 160#true, 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-02 20:32:54,324 INFO L383 tUnfolder$Statistics]: this new event has 104 ancestors and is cut-off event [2022-11-02 20:32:54,325 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-11-02 20:32:54,325 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-11-02 20:32:54,325 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is cut-off event [2022-11-02 20:32:54,739 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([593] L73-2-->L73-3: Formula: (= (+ |v_thread3Thread1of1ForFork2_#t~post7#1_3| 1) |v_thread3Thread1of1ForFork2_~i~2#1_11|) InVars {thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|} OutVars{thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1][729], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 109#L61true, Black: 3208#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 51#L99-1true, Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), 39#L73-3true, Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 2482#(<= 1 ~N~0), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 1719#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 136#L47-2true, Black: 4007#(<= 1 ~N~0), 5452#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 160#true, 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0))]) [2022-11-02 20:32:54,739 INFO L383 tUnfolder$Statistics]: this new event has 104 ancestors and is not cut-off event [2022-11-02 20:32:54,740 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is not cut-off event [2022-11-02 20:32:54,740 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is not cut-off event [2022-11-02 20:32:54,740 INFO L386 tUnfolder$Statistics]: existing Event has 104 ancestors and is not cut-off event [2022-11-02 20:32:56,013 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([593] L73-2-->L73-3: Formula: (= (+ |v_thread3Thread1of1ForFork2_#t~post7#1_3| 1) |v_thread3Thread1of1ForFork2_~i~2#1_11|) InVars {thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|} OutVars{thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1][729], [5463#true, 91#L53true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3208#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 90#L98-4true, Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 39#L73-3true, Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 2482#(<= 1 ~N~0), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 5452#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 160#true, Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, 109#L61true, Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 3961#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 1719#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 1741#(<= 1 ~N~0), Black: 4007#(<= 1 ~N~0)]) [2022-11-02 20:32:56,013 INFO L383 tUnfolder$Statistics]: this new event has 112 ancestors and is cut-off event [2022-11-02 20:32:56,013 INFO L386 tUnfolder$Statistics]: existing Event has 106 ancestors and is cut-off event [2022-11-02 20:32:56,013 INFO L386 tUnfolder$Statistics]: existing Event has 106 ancestors and is cut-off event [2022-11-02 20:32:56,013 INFO L386 tUnfolder$Statistics]: existing Event has 106 ancestors and is cut-off event [2022-11-02 20:32:56,013 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L61-->L63: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#res#1_1|)) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| |v_thread2Thread1of1ForFork1_plus_~a#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| v_~res2~0_33) (= (select (select |v_#memory_int_45| v_~A~0.base_34) (+ v_~A~0.offset_34 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_plus_#in~b#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)))) InVars {#memory_int=|v_#memory_int_45|, ~A~0.base=v_~A~0.base_34, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~res2~0=v_~res2~0_33} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.base=v_~A~0.base_34, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_1|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_1|, #memory_int=|v_#memory_int_45|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_1|, ~res2~0=v_~res2~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1][126], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 18#L73-2true, Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, 91#L53true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 2465#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 124#L63true, Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 90#L98-4true, Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 3961#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), Black: 4007#(<= 1 ~N~0), 160#true, 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)))]) [2022-11-02 20:32:56,014 INFO L383 tUnfolder$Statistics]: this new event has 112 ancestors and is cut-off event [2022-11-02 20:32:56,014 INFO L386 tUnfolder$Statistics]: existing Event has 106 ancestors and is cut-off event [2022-11-02 20:32:56,014 INFO L386 tUnfolder$Statistics]: existing Event has 106 ancestors and is cut-off event [2022-11-02 20:32:56,014 INFO L386 tUnfolder$Statistics]: existing Event has 106 ancestors and is cut-off event [2022-11-02 20:32:56,050 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([593] L73-2-->L73-3: Formula: (= (+ |v_thread3Thread1of1ForFork2_#t~post7#1_3| 1) |v_thread3Thread1of1ForFork2_~i~2#1_11|) InVars {thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|} OutVars{thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1][729], [5463#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3208#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 90#L98-4true, Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 39#L73-3true, Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 2482#(<= 1 ~N~0), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 136#L47-2true, 5452#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 160#true, Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, 109#L61true, Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 3961#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 1719#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 1741#(<= 1 ~N~0), Black: 4007#(<= 1 ~N~0)]) [2022-11-02 20:32:56,050 INFO L383 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-11-02 20:32:56,051 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-02 20:32:56,051 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-02 20:32:56,051 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-02 20:32:56,051 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L61-->L63: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#res#1_1|)) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| |v_thread2Thread1of1ForFork1_plus_~a#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| v_~res2~0_33) (= (select (select |v_#memory_int_45| v_~A~0.base_34) (+ v_~A~0.offset_34 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_plus_#in~b#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)))) InVars {#memory_int=|v_#memory_int_45|, ~A~0.base=v_~A~0.base_34, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~res2~0=v_~res2~0_33} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.base=v_~A~0.base_34, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_1|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_1|, #memory_int=|v_#memory_int_45|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_1|, ~res2~0=v_~res2~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1][126], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 18#L73-2true, Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 2465#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 124#L63true, Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), 90#L98-4true, Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 3961#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 136#L47-2true, Black: 4007#(<= 1 ~N~0), 160#true, 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)))]) [2022-11-02 20:32:56,051 INFO L383 tUnfolder$Statistics]: this new event has 113 ancestors and is cut-off event [2022-11-02 20:32:56,051 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-02 20:32:56,051 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-02 20:32:56,052 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-02 20:32:56,111 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([593] L73-2-->L73-3: Formula: (= (+ |v_thread3Thread1of1ForFork2_#t~post7#1_3| 1) |v_thread3Thread1of1ForFork2_~i~2#1_11|) InVars {thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|} OutVars{thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1][729], [5463#true, 91#L53true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3208#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 39#L73-3true, Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 2482#(<= 1 ~N~0), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 5452#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 160#true, Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, 109#L61true, 51#L99-1true, Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 3961#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 1719#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 1741#(<= 1 ~N~0), Black: 4007#(<= 1 ~N~0)]) [2022-11-02 20:32:56,111 INFO L383 tUnfolder$Statistics]: this new event has 115 ancestors and is cut-off event [2022-11-02 20:32:56,111 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-02 20:32:56,112 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-02 20:32:56,112 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-02 20:32:56,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L61-->L63: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#res#1_1|)) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| |v_thread2Thread1of1ForFork1_plus_~a#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| v_~res2~0_33) (= (select (select |v_#memory_int_45| v_~A~0.base_34) (+ v_~A~0.offset_34 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_plus_#in~b#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)))) InVars {#memory_int=|v_#memory_int_45|, ~A~0.base=v_~A~0.base_34, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~res2~0=v_~res2~0_33} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.base=v_~A~0.base_34, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_1|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_1|, #memory_int=|v_#memory_int_45|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_1|, ~res2~0=v_~res2~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1][126], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 18#L73-2true, Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, 91#L53true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 2465#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 51#L99-1true, Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 124#L63true, Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 3961#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), Black: 4007#(<= 1 ~N~0), 160#true, 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)))]) [2022-11-02 20:32:56,112 INFO L383 tUnfolder$Statistics]: this new event has 115 ancestors and is cut-off event [2022-11-02 20:32:56,113 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-02 20:32:56,113 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-02 20:32:56,113 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-02 20:32:56,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([593] L73-2-->L73-3: Formula: (= (+ |v_thread3Thread1of1ForFork2_#t~post7#1_3| 1) |v_thread3Thread1of1ForFork2_~i~2#1_11|) InVars {thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|} OutVars{thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_3|, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_11|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1][729], [5463#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3208#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 39#L73-3true, Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 2482#(<= 1 ~N~0), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 136#L47-2true, 5452#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 160#true, Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, 109#L61true, 51#L99-1true, Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 3961#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 1719#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0)), 1741#(<= 1 ~N~0), Black: 4007#(<= 1 ~N~0)]) [2022-11-02 20:32:56,144 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-02 20:32:56,145 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:32:56,145 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:32:56,145 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:32:56,145 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([578] L61-->L63: Formula: (let ((.cse0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|))) (and (<= 0 (+ 2147483648 |v_thread2Thread1of1ForFork1_plus_#res#1_1|)) (= .cse0 |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (<= |v_thread2Thread1of1ForFork1_plus_#res#1_1| 2147483647) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0)) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| |v_thread2Thread1of1ForFork1_plus_~a#1_1|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread2Thread1of1ForFork1_plus_~b#1_1| 0)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| v_~res2~0_33) (= (select (select |v_#memory_int_45| v_~A~0.base_34) (+ v_~A~0.offset_34 (* |v_thread2Thread1of1ForFork1_~i~1#1_7| 4))) |v_thread2Thread1of1ForFork1_plus_#in~b#1_1|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= |v_thread2Thread1of1ForFork1_~tmp~1#1_1| |v_thread2Thread1of1ForFork1_plus_#res#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (not (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_plus_~b#1_1|) (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_1| |v_thread2Thread1of1ForFork1_plus_~b#1_1| 2147483648))) 1 0) 0)))) InVars {#memory_int=|v_#memory_int_45|, ~A~0.base=v_~A~0.base_34, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, ~res2~0=v_~res2~0_33} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_1|, ~A~0.base=v_~A~0.base_34, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_7|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_1|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, ~A~0.offset=v_~A~0.offset_34, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_1|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_1|, #memory_int=|v_#memory_int_45|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, thread2Thread1of1ForFork1_~tmp~1#1=|v_thread2Thread1of1ForFork1_~tmp~1#1_1|, thread2Thread1of1ForFork1_#t~ret6#1=|v_thread2Thread1of1ForFork1_#t~ret6#1_1|, ~res2~0=v_~res2~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~tmp~1#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_#t~ret6#1][126], [Black: 186#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1723#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1725#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 18#L73-2true, Black: 1721#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (<= 1 ~M~0))), 5463#true, Black: 1727#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= 1 ~M~0)), Black: 1000#(<= 1 ~N~0), 157#true, Black: 3204#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 3206#(and (<= 1 ~N~0) (or (< 0 ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), 2465#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 3965#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3941#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 51#L99-1true, Black: 3939#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3957#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), 124#L63true, Black: 5454#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3981#(and (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3974#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 5456#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 3963#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3959#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3951#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 3976#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0)) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3967#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 979#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 977#(and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 1) (<= 1 ~N~0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= 1 ~N~0)) (or (<= 1 ~N~0) (< |ULTIMATE.start_create_fresh_int_array_#in~size#1| 1))), Black: 3969#(and (<= |thread3Thread1of1ForFork2_~i~2#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 981#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 3947#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 0 |thread1Thread1of1ForFork0_~i~0#1|) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 3949#(and (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0) (<= 1 ~M~0)), Black: 985#(and (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 987#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), 3961#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~N~0)), Black: 2467#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 2461#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0)), Black: 2469#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0)), Black: 2463#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0))), Black: 1741#(<= 1 ~N~0), Black: 167#(and (= ~res2~0 ~res1~0) (= ~res1~0 0)), 136#L47-2true, Black: 4007#(<= 1 ~N~0), 160#true, 5458#(and (< |thread2Thread1of1ForFork1_~i~1#1| ~M~0) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork2_~i~2#1| ~N~0) (< 0 ~M~0)))]) [2022-11-02 20:32:56,145 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-02 20:32:56,145 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:32:56,145 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:32:56,145 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:32:56,543 INFO L130 PetriNetUnfolder]: 23572/41857 cut-off events. [2022-11-02 20:32:56,544 INFO L131 PetriNetUnfolder]: For 256375/257651 co-relation queries the response was YES. [2022-11-02 20:32:56,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157626 conditions, 41857 events. 23572/41857 cut-off events. For 256375/257651 co-relation queries the response was YES. Maximal size of possible extension queue 2199. Compared 394978 event pairs, 4461 based on Foata normal form. 449/41842 useless extension candidates. Maximal degree in co-relation 157583. Up to 14627 conditions per place. [2022-11-02 20:32:57,113 INFO L137 encePairwiseOnDemand]: 118/156 looper letters, 529 selfloop transitions, 294 changer transitions 6/951 dead transitions. [2022-11-02 20:32:57,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 951 transitions, 10470 flow [2022-11-02 20:32:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-02 20:32:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-11-02 20:32:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 3470 transitions. [2022-11-02 20:32:57,122 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.4277613412228797 [2022-11-02 20:32:57,123 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 3470 transitions. [2022-11-02 20:32:57,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 3470 transitions. [2022-11-02 20:32:57,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:32:57,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 3470 transitions. [2022-11-02 20:32:57,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 66.73076923076923) internal successors, (3470), 52 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:57,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 156.0) internal successors, (8268), 53 states have internal predecessors, (8268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:57,155 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 156.0) internal successors, (8268), 53 states have internal predecessors, (8268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:32:57,155 INFO L175 Difference]: Start difference. First operand has 223 places, 296 transitions, 3074 flow. Second operand 52 states and 3470 transitions. [2022-11-02 20:32:57,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 951 transitions, 10470 flow [2022-11-02 20:33:00,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 951 transitions, 10309 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-11-02 20:33:00,236 INFO L231 Difference]: Finished difference. Result has 294 places, 578 transitions, 7611 flow [2022-11-02 20:33:00,236 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=3010, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=7611, PETRI_PLACES=294, PETRI_TRANSITIONS=578} [2022-11-02 20:33:00,237 INFO L287 CegarLoopForPetriNet]: 140 programPoint places, 154 predicate places. [2022-11-02 20:33:00,237 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 578 transitions, 7611 flow [2022-11-02 20:33:00,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 61.36363636363637) internal successors, (4725), 77 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:00,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:33:00,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:00,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:00,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:33:00,465 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-11-02 20:33:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash -677729218, now seen corresponding path program 2 times [2022-11-02 20:33:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:00,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004890192] [2022-11-02 20:33:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:33:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:02,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004890192] [2022-11-02 20:33:02,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004890192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:02,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934667463] [2022-11-02 20:33:02,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:33:02,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:02,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:02,274 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:02,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0b9dbd15-1f21-41b6-8411-097b19185832/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:33:02,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:33:02,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:33:02,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-02 20:33:02,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:03,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:33:03,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:33:03,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:33:03,524 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 17 [2022-11-02 20:33:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:33:04,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:33:08,178 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:33:08,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 54 treesize of output 42 [2022-11-02 20:33:08,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-11-02 20:33:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:33:08,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934667463] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:33:08,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:33:08,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 25] total 62 [2022-11-02 20:33:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728789146] [2022-11-02 20:33:08,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:33:08,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-02 20:33:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-02 20:33:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3281, Unknown=21, NotChecked=0, Total=3782 [2022-11-02 20:33:08,859 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 156 [2022-11-02 20:33:08,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 578 transitions, 7611 flow. Second operand has 62 states, 62 states have (on average 67.69354838709677) internal successors, (4197), 62 states have internal predecessors, (4197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:08,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:33:08,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 156 [2022-11-02 20:33:08,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand