./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e54e3c041005c4525c3228cc12d27a93b528db4b6a57c9d2a4209bc47f8ee6e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:02:03,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:02:03,333 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 08:02:03,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:02:03,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:02:03,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:02:03,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:02:03,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:02:03,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:02:03,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:02:03,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:02:03,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:02:03,383 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:02:03,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:02:03,386 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:02:03,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:02:03,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:02:03,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:02:03,388 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:02:03,388 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:02:03,389 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:02:03,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:02:03,390 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:02:03,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:02:03,391 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:02:03,391 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:02:03,392 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:02:03,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:02:03,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:02:03,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:02:03,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:02:03,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:02:03,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:02:03,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:02:03,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:02:03,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:02:03,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:02:03,397 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:02:03,397 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/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_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 2e54e3c041005c4525c3228cc12d27a93b528db4b6a57c9d2a4209bc47f8ee6e [2023-11-19 08:02:03,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:02:03,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:02:03,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:02:03,784 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:02:03,786 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:02:03,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2023-11-19 08:02:06,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:02:07,201 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:02:07,202 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2023-11-19 08:02:07,220 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/data/894882fed/167a1e96a4584e1d92b4df7bd07b5a3d/FLAGdd6ac3b3d [2023-11-19 08:02:07,234 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/data/894882fed/167a1e96a4584e1d92b4df7bd07b5a3d [2023-11-19 08:02:07,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:02:07,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:02:07,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:02:07,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:02:07,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:02:07,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8ea756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07, skipping insertion in model container [2023-11-19 08:02:07,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,296 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:02:07,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:02:07,672 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:02:07,742 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:02:07,794 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:02:07,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07 WrapperNode [2023-11-19 08:02:07,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:02:07,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:02:07,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:02:07,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:02:07,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,844 INFO L138 Inliner]: procedures = 171, calls = 27, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 94 [2023-11-19 08:02:07,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:02:07,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:02:07,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:02:07,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:02:07,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,867 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:02:07,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:02:07,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:02:07,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:02:07,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (1/1) ... [2023-11-19 08:02:07,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:02:07,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:07,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:02:07,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:02:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:02:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-19 08:02:08,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-19 08:02:08,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:02:08,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:02:08,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:02:08,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:02:08,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:02:08,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:02:08,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:02:08,031 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:02:08,195 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:02:08,198 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:02:08,472 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:02:08,591 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:02:08,597 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 08:02:08,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:08 BoogieIcfgContainer [2023-11-19 08:02:08,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:02:08,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:02:08,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:02:08,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:02:08,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:02:07" (1/3) ... [2023-11-19 08:02:08,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674c76e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:08, skipping insertion in model container [2023-11-19 08:02:08,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:02:07" (2/3) ... [2023-11-19 08:02:08,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674c76e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:02:08, skipping insertion in model container [2023-11-19 08:02:08,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:02:08" (3/3) ... [2023-11-19 08:02:08,618 INFO L112 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2023-11-19 08:02:08,642 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:02:08,642 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-19 08:02:08,643 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:02:08,740 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:02:08,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 91 transitions, 186 flow [2023-11-19 08:02:08,844 INFO L124 PetriNetUnfolderBase]: 8/107 cut-off events. [2023-11-19 08:02:08,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:08,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 107 events. 8/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 145 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 69. Up to 4 conditions per place. [2023-11-19 08:02:08,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 91 transitions, 186 flow [2023-11-19 08:02:08,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 91 transitions, 186 flow [2023-11-19 08:02:08,862 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:02:08,873 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 91 transitions, 186 flow [2023-11-19 08:02:08,877 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 91 transitions, 186 flow [2023-11-19 08:02:08,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 91 transitions, 186 flow [2023-11-19 08:02:08,911 INFO L124 PetriNetUnfolderBase]: 8/107 cut-off events. [2023-11-19 08:02:08,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:08,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 107 events. 8/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 145 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 69. Up to 4 conditions per place. [2023-11-19 08:02:08,916 INFO L119 LiptonReduction]: Number of co-enabled transitions 1938 [2023-11-19 08:02:12,657 INFO L134 LiptonReduction]: Checked pairs total: 2015 [2023-11-19 08:02:12,657 INFO L136 LiptonReduction]: Total number of compositions: 102 [2023-11-19 08:02:12,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:02:12,680 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@31ef58c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:02:12,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 08:02:12,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:02:12,683 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 08:02:12,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:12,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:12,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:12,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 08:02:12,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash 15710, now seen corresponding path program 1 times [2023-11-19 08:02:12,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:12,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215120451] [2023-11-19 08:02:12,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:12,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215120451] [2023-11-19 08:02:12,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215120451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:12,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:12,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885793799] [2023-11-19 08:02:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:12,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:02:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:12,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:02:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:02:12,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 193 [2023-11-19 08:02:12,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 34 flow. Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:12,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:12,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 193 [2023-11-19 08:02:12,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:13,061 INFO L124 PetriNetUnfolderBase]: 21/51 cut-off events. [2023-11-19 08:02:13,061 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:13,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 51 events. 21/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 129 event pairs, 16 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 90. Up to 51 conditions per place. [2023-11-19 08:02:13,065 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 11 selfloop transitions, 0 changer transitions 0/12 dead transitions. [2023-11-19 08:02:13,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 12 transitions, 50 flow [2023-11-19 08:02:13,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:02:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:02:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2023-11-19 08:02:13,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44559585492227977 [2023-11-19 08:02:13,086 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 172 transitions. [2023-11-19 08:02:13,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 172 transitions. [2023-11-19 08:02:13,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:13,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 172 transitions. [2023-11-19 08:02:13,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,100 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,102 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 34 flow. Second operand 2 states and 172 transitions. [2023-11-19 08:02:13,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 12 transitions, 50 flow [2023-11-19 08:02:13,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 12 transitions, 50 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:13,107 INFO L231 Difference]: Finished difference. Result has 15 places, 12 transitions, 28 flow [2023-11-19 08:02:13,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=28, PETRI_PLACES=15, PETRI_TRANSITIONS=12} [2023-11-19 08:02:13,113 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -2 predicate places. [2023-11-19 08:02:13,113 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 12 transitions, 28 flow [2023-11-19 08:02:13,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:13,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:13,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:02:13,114 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 08:02:13,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:13,115 INFO L85 PathProgramCache]: Analyzing trace with hash 15728, now seen corresponding path program 1 times [2023-11-19 08:02:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:13,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392782576] [2023-11-19 08:02:13,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:13,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:13,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:13,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392782576] [2023-11-19 08:02:13,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392782576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:13,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:13,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:13,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556232335] [2023-11-19 08:02:13,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:13,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:13,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:13,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:13,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:13,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 193 [2023-11-19 08:02:13,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 12 transitions, 28 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:13,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 193 [2023-11-19 08:02:13,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:13,311 INFO L124 PetriNetUnfolderBase]: 16/40 cut-off events. [2023-11-19 08:02:13,312 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:13,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 40 events. 16/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 93 event pairs, 12 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 81. Up to 39 conditions per place. [2023-11-19 08:02:13,313 INFO L140 encePairwiseOnDemand]: 191/193 looper letters, 9 selfloop transitions, 1 changer transitions 0/11 dead transitions. [2023-11-19 08:02:13,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 11 transitions, 46 flow [2023-11-19 08:02:13,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2023-11-19 08:02:13,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3920552677029361 [2023-11-19 08:02:13,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 227 transitions. [2023-11-19 08:02:13,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 227 transitions. [2023-11-19 08:02:13,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:13,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 227 transitions. [2023-11-19 08:02:13,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,322 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 28 flow. Second operand 3 states and 227 transitions. [2023-11-19 08:02:13,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 11 transitions, 46 flow [2023-11-19 08:02:13,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 11 transitions, 46 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:13,324 INFO L231 Difference]: Finished difference. Result has 16 places, 11 transitions, 28 flow [2023-11-19 08:02:13,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=28, PETRI_PLACES=16, PETRI_TRANSITIONS=11} [2023-11-19 08:02:13,325 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-11-19 08:02:13,325 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 11 transitions, 28 flow [2023-11-19 08:02:13,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:13,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:13,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:02:13,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 08:02:13,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash 15729, now seen corresponding path program 1 times [2023-11-19 08:02:13,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:13,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84882544] [2023-11-19 08:02:13,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:13,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:13,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84882544] [2023-11-19 08:02:13,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84882544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:13,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:13,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082358109] [2023-11-19 08:02:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:13,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:13,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 193 [2023-11-19 08:02:13,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 11 transitions, 28 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:13,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 193 [2023-11-19 08:02:13,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:13,508 INFO L124 PetriNetUnfolderBase]: 11/29 cut-off events. [2023-11-19 08:02:13,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:13,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 29 events. 11/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 57 event pairs, 8 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 60. Up to 28 conditions per place. [2023-11-19 08:02:13,510 INFO L140 encePairwiseOnDemand]: 191/193 looper letters, 8 selfloop transitions, 1 changer transitions 0/10 dead transitions. [2023-11-19 08:02:13,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 10 transitions, 44 flow [2023-11-19 08:02:13,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2023-11-19 08:02:13,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006908462867012 [2023-11-19 08:02:13,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 232 transitions. [2023-11-19 08:02:13,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 232 transitions. [2023-11-19 08:02:13,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:13,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 232 transitions. [2023-11-19 08:02:13,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,526 INFO L175 Difference]: Start difference. First operand has 16 places, 11 transitions, 28 flow. Second operand 3 states and 232 transitions. [2023-11-19 08:02:13,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 10 transitions, 44 flow [2023-11-19 08:02:13,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 10 transitions, 43 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:13,528 INFO L231 Difference]: Finished difference. Result has 16 places, 10 transitions, 27 flow [2023-11-19 08:02:13,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=25, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=27, PETRI_PLACES=16, PETRI_TRANSITIONS=10} [2023-11-19 08:02:13,530 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-11-19 08:02:13,530 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 10 transitions, 27 flow [2023-11-19 08:02:13,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:13,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:02:13,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:02:13,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 08:02:13,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash 468884698, now seen corresponding path program 1 times [2023-11-19 08:02:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:13,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490280870] [2023-11-19 08:02:13,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:13,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490280870] [2023-11-19 08:02:13,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490280870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:13,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:13,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:02:13,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566528336] [2023-11-19 08:02:13,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:13,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:13,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:13,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:13,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:02:13,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 193 [2023-11-19 08:02:13,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 10 transitions, 27 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:13,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 193 [2023-11-19 08:02:13,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:13,917 INFO L124 PetriNetUnfolderBase]: 9/24 cut-off events. [2023-11-19 08:02:13,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:13,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 24 events. 9/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 38 event pairs, 6 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 51. Up to 23 conditions per place. [2023-11-19 08:02:13,918 INFO L140 encePairwiseOnDemand]: 191/193 looper letters, 7 selfloop transitions, 1 changer transitions 0/9 dead transitions. [2023-11-19 08:02:13,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 9 transitions, 41 flow [2023-11-19 08:02:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2023-11-19 08:02:13,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37305699481865284 [2023-11-19 08:02:13,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions. [2023-11-19 08:02:13,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions. [2023-11-19 08:02:13,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:13,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions. [2023-11-19 08:02:13,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,926 INFO L175 Difference]: Start difference. First operand has 16 places, 10 transitions, 27 flow. Second operand 3 states and 216 transitions. [2023-11-19 08:02:13,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 9 transitions, 41 flow [2023-11-19 08:02:13,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 9 transitions, 40 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:13,927 INFO L231 Difference]: Finished difference. Result has 16 places, 9 transitions, 26 flow [2023-11-19 08:02:13,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=24, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=26, PETRI_PLACES=16, PETRI_TRANSITIONS=9} [2023-11-19 08:02:13,928 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-11-19 08:02:13,928 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 9 transitions, 26 flow [2023-11-19 08:02:13,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:13,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:13,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:02:13,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:02:13,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 08:02:13,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 468884699, now seen corresponding path program 1 times [2023-11-19 08:02:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:13,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972704976] [2023-11-19 08:02:13,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:13,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:14,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:14,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972704976] [2023-11-19 08:02:14,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972704976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:14,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:14,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:14,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080060769] [2023-11-19 08:02:14,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:14,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:02:14,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:14,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:02:14,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:14,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 193 [2023-11-19 08:02:14,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 9 transitions, 26 flow. Second operand has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:14,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:14,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 193 [2023-11-19 08:02:14,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:14,480 INFO L124 PetriNetUnfolderBase]: 14/32 cut-off events. [2023-11-19 08:02:14,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:14,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 32 events. 14/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 52 event pairs, 6 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 68. Up to 26 conditions per place. [2023-11-19 08:02:14,483 INFO L140 encePairwiseOnDemand]: 188/193 looper letters, 8 selfloop transitions, 4 changer transitions 0/13 dead transitions. [2023-11-19 08:02:14,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 13 transitions, 58 flow [2023-11-19 08:02:14,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:02:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2023-11-19 08:02:14,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3639896373056995 [2023-11-19 08:02:14,492 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 281 transitions. [2023-11-19 08:02:14,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 281 transitions. [2023-11-19 08:02:14,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:14,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 281 transitions. [2023-11-19 08:02:14,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:14,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:14,499 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:14,499 INFO L175 Difference]: Start difference. First operand has 16 places, 9 transitions, 26 flow. Second operand 4 states and 281 transitions. [2023-11-19 08:02:14,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 13 transitions, 58 flow [2023-11-19 08:02:14,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 13 transitions, 57 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:14,500 INFO L231 Difference]: Finished difference. Result has 19 places, 11 transitions, 46 flow [2023-11-19 08:02:14,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=25, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=46, PETRI_PLACES=19, PETRI_TRANSITIONS=11} [2023-11-19 08:02:14,505 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 2 predicate places. [2023-11-19 08:02:14,505 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 11 transitions, 46 flow [2023-11-19 08:02:14,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.0) internal successors, (340), 5 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:14,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:14,506 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-19 08:02:14,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:02:14,506 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-19 08:02:14,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1650464993, now seen corresponding path program 1 times [2023-11-19 08:02:14,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:14,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004538475] [2023-11-19 08:02:14,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:14,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:02:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:14,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:02:14,558 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:02:14,560 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-11-19 08:02:14,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2023-11-19 08:02:14,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 08:02:14,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2023-11-19 08:02:14,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 08:02:14,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 08:02:14,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 08:02:14,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2023-11-19 08:02:14,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2023-11-19 08:02:14,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 08:02:14,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:02:14,571 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-19 08:02:14,575 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 08:02:14,575 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-19 08:02:14,615 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:02:14,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 143 transitions, 296 flow [2023-11-19 08:02:14,673 INFO L124 PetriNetUnfolderBase]: 15/177 cut-off events. [2023-11-19 08:02:14,674 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 08:02:14,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 177 events. 15/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 400 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 120. Up to 6 conditions per place. [2023-11-19 08:02:14,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 143 transitions, 296 flow [2023-11-19 08:02:14,681 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 143 transitions, 296 flow [2023-11-19 08:02:14,682 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:02:14,682 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 143 transitions, 296 flow [2023-11-19 08:02:14,682 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 143 transitions, 296 flow [2023-11-19 08:02:14,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 143 transitions, 296 flow [2023-11-19 08:02:14,717 INFO L124 PetriNetUnfolderBase]: 15/177 cut-off events. [2023-11-19 08:02:14,717 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 08:02:14,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 177 events. 15/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 400 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 120. Up to 6 conditions per place. [2023-11-19 08:02:14,728 INFO L119 LiptonReduction]: Number of co-enabled transitions 9180 [2023-11-19 08:02:17,715 INFO L134 LiptonReduction]: Checked pairs total: 19589 [2023-11-19 08:02:17,716 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-11-19 08:02:17,718 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:02:17,719 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@31ef58c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:02:17,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 08:02:17,721 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:02:17,722 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 08:02:17,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:17,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:17,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:17,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 08:02:17,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash 26295, now seen corresponding path program 1 times [2023-11-19 08:02:17,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:17,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723068119] [2023-11-19 08:02:17,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:17,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:17,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723068119] [2023-11-19 08:02:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723068119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:17,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:17,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:17,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380090534] [2023-11-19 08:02:17,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:17,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:02:17,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:17,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:02:17,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:02:17,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 278 [2023-11-19 08:02:17,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 104 flow. Second operand has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:17,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:17,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 278 [2023-11-19 08:02:17,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:18,006 INFO L124 PetriNetUnfolderBase]: 855/1521 cut-off events. [2023-11-19 08:02:18,007 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-19 08:02:18,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 1521 events. 855/1521 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9518 event pairs, 727 based on Foata normal form. 44/946 useless extension candidates. Maximal degree in co-relation 946. Up to 1304 conditions per place. [2023-11-19 08:02:18,025 INFO L140 encePairwiseOnDemand]: 272/278 looper letters, 27 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2023-11-19 08:02:18,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 140 flow [2023-11-19 08:02:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:02:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:02:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 275 transitions. [2023-11-19 08:02:18,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49460431654676257 [2023-11-19 08:02:18,028 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 275 transitions. [2023-11-19 08:02:18,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 275 transitions. [2023-11-19 08:02:18,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:18,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 275 transitions. [2023-11-19 08:02:18,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,033 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 278.0) internal successors, (834), 3 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,033 INFO L175 Difference]: Start difference. First operand has 44 places, 47 transitions, 104 flow. Second operand 2 states and 275 transitions. [2023-11-19 08:02:18,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 140 flow [2023-11-19 08:02:18,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:18,036 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 86 flow [2023-11-19 08:02:18,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-11-19 08:02:18,037 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-11-19 08:02:18,037 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 86 flow [2023-11-19 08:02:18,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:18,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:18,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:02:18,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 08:02:18,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash 26316, now seen corresponding path program 1 times [2023-11-19 08:02:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:18,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510307149] [2023-11-19 08:02:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:18,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:18,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510307149] [2023-11-19 08:02:18,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510307149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:18,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:18,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799339836] [2023-11-19 08:02:18,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:18,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:18,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:18,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:18,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:18,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 278 [2023-11-19 08:02:18,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:18,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 278 [2023-11-19 08:02:18,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:18,292 INFO L124 PetriNetUnfolderBase]: 614/1120 cut-off events. [2023-11-19 08:02:18,292 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-19 08:02:18,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2110 conditions, 1120 events. 614/1120 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6665 event pairs, 518 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 2105. Up to 950 conditions per place. [2023-11-19 08:02:18,302 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 25 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-11-19 08:02:18,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 136 flow [2023-11-19 08:02:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-11-19 08:02:18,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44964028776978415 [2023-11-19 08:02:18,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-11-19 08:02:18,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-11-19 08:02:18,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:18,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-11-19 08:02:18,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,312 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,312 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 86 flow. Second operand 3 states and 375 transitions. [2023-11-19 08:02:18,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 136 flow [2023-11-19 08:02:18,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:18,314 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 86 flow [2023-11-19 08:02:18,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-11-19 08:02:18,315 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-19 08:02:18,315 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 86 flow [2023-11-19 08:02:18,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:18,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:18,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:02:18,317 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 08:02:18,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash 26315, now seen corresponding path program 1 times [2023-11-19 08:02:18,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:18,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133853888] [2023-11-19 08:02:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:18,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:18,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:18,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133853888] [2023-11-19 08:02:18,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133853888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:18,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:18,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:18,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228011526] [2023-11-19 08:02:18,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:18,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:18,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:18,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:18,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:18,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 278 [2023-11-19 08:02:18,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:18,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 278 [2023-11-19 08:02:18,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:18,506 INFO L124 PetriNetUnfolderBase]: 373/719 cut-off events. [2023-11-19 08:02:18,507 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-19 08:02:18,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358 conditions, 719 events. 373/719 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3880 event pairs, 309 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 1352. Up to 597 conditions per place. [2023-11-19 08:02:18,513 INFO L140 encePairwiseOnDemand]: 276/278 looper letters, 24 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2023-11-19 08:02:18,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 134 flow [2023-11-19 08:02:18,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-11-19 08:02:18,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4412470023980815 [2023-11-19 08:02:18,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-11-19 08:02:18,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-11-19 08:02:18,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:18,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-11-19 08:02:18,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,522 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,522 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 86 flow. Second operand 3 states and 368 transitions. [2023-11-19 08:02:18,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 134 flow [2023-11-19 08:02:18,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:18,524 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 85 flow [2023-11-19 08:02:18,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-11-19 08:02:18,525 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-19 08:02:18,525 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 85 flow [2023-11-19 08:02:18,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:18,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:02:18,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:02:18,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 08:02:18,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:18,527 INFO L85 PathProgramCache]: Analyzing trace with hash 784576971, now seen corresponding path program 1 times [2023-11-19 08:02:18,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:18,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697059027] [2023-11-19 08:02:18,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:18,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:18,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697059027] [2023-11-19 08:02:18,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697059027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:18,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:18,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:02:18,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129416338] [2023-11-19 08:02:18,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:18,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:18,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:18,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:18,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:02:18,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 278 [2023-11-19 08:02:18,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:18,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 278 [2023-11-19 08:02:18,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:18,834 INFO L124 PetriNetUnfolderBase]: 309/602 cut-off events. [2023-11-19 08:02:18,834 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-19 08:02:18,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 602 events. 309/602 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3089 event pairs, 251 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 1129. Up to 493 conditions per place. [2023-11-19 08:02:18,839 INFO L140 encePairwiseOnDemand]: 275/278 looper letters, 22 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-11-19 08:02:18,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 127 flow [2023-11-19 08:02:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-19 08:02:18,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42206235011990406 [2023-11-19 08:02:18,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-19 08:02:18,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-19 08:02:18,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:18,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-19 08:02:18,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,847 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 85 flow. Second operand 3 states and 352 transitions. [2023-11-19 08:02:18,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 127 flow [2023-11-19 08:02:18,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 126 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:18,850 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 82 flow [2023-11-19 08:02:18,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-11-19 08:02:18,852 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2023-11-19 08:02:18,852 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 82 flow [2023-11-19 08:02:18,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:18,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:02:18,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:02:18,853 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 08:02:18,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:18,854 INFO L85 PathProgramCache]: Analyzing trace with hash 784576972, now seen corresponding path program 1 times [2023-11-19 08:02:18,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:18,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579353977] [2023-11-19 08:02:18,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:18,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:19,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:19,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579353977] [2023-11-19 08:02:19,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579353977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:19,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:19,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010439726] [2023-11-19 08:02:19,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:19,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:02:19,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:19,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:02:19,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:19,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 278 [2023-11-19 08:02:19,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:19,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:19,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 278 [2023-11-19 08:02:19,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:19,385 INFO L124 PetriNetUnfolderBase]: 530/1010 cut-off events. [2023-11-19 08:02:19,385 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2023-11-19 08:02:19,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 1010 events. 530/1010 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5630 event pairs, 265 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1902. Up to 493 conditions per place. [2023-11-19 08:02:19,395 INFO L140 encePairwiseOnDemand]: 273/278 looper letters, 38 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-11-19 08:02:19,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 205 flow [2023-11-19 08:02:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:02:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-11-19 08:02:19,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4307553956834532 [2023-11-19 08:02:19,399 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-11-19 08:02:19,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-11-19 08:02:19,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:19,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-11-19 08:02:19,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:19,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:19,404 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:19,405 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 82 flow. Second operand 4 states and 479 transitions. [2023-11-19 08:02:19,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 205 flow [2023-11-19 08:02:19,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:19,408 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 97 flow [2023-11-19 08:02:19,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-11-19 08:02:19,410 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2023-11-19 08:02:19,410 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 97 flow [2023-11-19 08:02:19,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:19,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:19,411 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:19,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:02:19,432 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 08:02:19,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:19,432 INFO L85 PathProgramCache]: Analyzing trace with hash 578726473, now seen corresponding path program 1 times [2023-11-19 08:02:19,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:19,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814120786] [2023-11-19 08:02:19,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:19,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 08:02:19,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:19,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814120786] [2023-11-19 08:02:19,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814120786] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:19,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913383169] [2023-11-19 08:02:19,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:19,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:19,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:19,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:19,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:02:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:19,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-19 08:02:19,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:02:19,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:02:19,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2023-11-19 08:02:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 08:02:19,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:02:19,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913383169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:19,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 08:02:19,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-11-19 08:02:19,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120407209] [2023-11-19 08:02:19,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:19,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:19,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:19,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:19,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:02:19,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 278 [2023-11-19 08:02:19,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:19,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:19,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 278 [2023-11-19 08:02:19,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:20,278 INFO L124 PetriNetUnfolderBase]: 912/1715 cut-off events. [2023-11-19 08:02:20,278 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-11-19 08:02:20,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3351 conditions, 1715 events. 912/1715 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10130 event pairs, 440 based on Foata normal form. 0/1435 useless extension candidates. Maximal degree in co-relation 3344. Up to 870 conditions per place. [2023-11-19 08:02:20,296 INFO L140 encePairwiseOnDemand]: 273/278 looper letters, 39 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-11-19 08:02:20,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 233 flow [2023-11-19 08:02:20,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:02:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 498 transitions. [2023-11-19 08:02:20,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.447841726618705 [2023-11-19 08:02:20,300 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 498 transitions. [2023-11-19 08:02:20,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 498 transitions. [2023-11-19 08:02:20,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:20,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 498 transitions. [2023-11-19 08:02:20,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:20,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:20,305 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 278.0) internal successors, (1390), 5 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:20,306 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 97 flow. Second operand 4 states and 498 transitions. [2023-11-19 08:02:20,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 233 flow [2023-11-19 08:02:20,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 227 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:20,310 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 114 flow [2023-11-19 08:02:20,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-11-19 08:02:20,311 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2023-11-19 08:02:20,312 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 114 flow [2023-11-19 08:02:20,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:20,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:20,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:20,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 08:02:20,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-19 08:02:20,534 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 08:02:20,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:20,534 INFO L85 PathProgramCache]: Analyzing trace with hash 515390490, now seen corresponding path program 1 times [2023-11-19 08:02:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:20,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093667419] [2023-11-19 08:02:20,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:20,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:20,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093667419] [2023-11-19 08:02:20,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093667419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:20,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:20,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:02:20,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547148402] [2023-11-19 08:02:20,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:20,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:20,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:20,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 278 [2023-11-19 08:02:20,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:20,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:20,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 278 [2023-11-19 08:02:20,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:21,040 INFO L124 PetriNetUnfolderBase]: 1739/2935 cut-off events. [2023-11-19 08:02:21,040 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2023-11-19 08:02:21,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6477 conditions, 2935 events. 1739/2935 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17960 event pairs, 656 based on Foata normal form. 0/2576 useless extension candidates. Maximal degree in co-relation 6469. Up to 1653 conditions per place. [2023-11-19 08:02:21,066 INFO L140 encePairwiseOnDemand]: 270/278 looper letters, 48 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2023-11-19 08:02:21,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 296 flow [2023-11-19 08:02:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-11-19 08:02:21,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4556354916067146 [2023-11-19 08:02:21,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-11-19 08:02:21,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-11-19 08:02:21,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:21,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-11-19 08:02:21,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:21,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:21,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 278.0) internal successors, (1112), 4 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:21,073 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 114 flow. Second operand 3 states and 380 transitions. [2023-11-19 08:02:21,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 296 flow [2023-11-19 08:02:21,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:21,076 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 155 flow [2023-11-19 08:02:21,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=278, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-11-19 08:02:21,077 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-11-19 08:02:21,077 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 155 flow [2023-11-19 08:02:21,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:21,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:21,078 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-19 08:02:21,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 08:02:21,078 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-19 08:02:21,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2097657455, now seen corresponding path program 1 times [2023-11-19 08:02:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:21,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875430945] [2023-11-19 08:02:21,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:21,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:21,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:02:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:02:21,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:02:21,102 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:02:21,103 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2023-11-19 08:02:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2023-11-19 08:02:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-19 08:02:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2023-11-19 08:02:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-19 08:02:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-19 08:02:21,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2023-11-19 08:02:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-19 08:02:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2023-11-19 08:02:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2023-11-19 08:02:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2023-11-19 08:02:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2023-11-19 08:02:21,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-19 08:02:21,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 08:02:21,105 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:21,105 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 08:02:21,105 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-19 08:02:21,141 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:02:21,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 195 transitions, 408 flow [2023-11-19 08:02:21,178 INFO L124 PetriNetUnfolderBase]: 22/247 cut-off events. [2023-11-19 08:02:21,178 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 08:02:21,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 247 events. 22/247 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 736 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 181. Up to 8 conditions per place. [2023-11-19 08:02:21,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 195 transitions, 408 flow [2023-11-19 08:02:21,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 195 transitions, 408 flow [2023-11-19 08:02:21,183 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:02:21,183 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 195 transitions, 408 flow [2023-11-19 08:02:21,184 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 195 transitions, 408 flow [2023-11-19 08:02:21,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 195 transitions, 408 flow [2023-11-19 08:02:21,217 INFO L124 PetriNetUnfolderBase]: 22/247 cut-off events. [2023-11-19 08:02:21,217 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 08:02:21,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 247 events. 22/247 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 736 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 181. Up to 8 conditions per place. [2023-11-19 08:02:21,235 INFO L119 LiptonReduction]: Number of co-enabled transitions 21726 [2023-11-19 08:02:25,036 INFO L134 LiptonReduction]: Checked pairs total: 48793 [2023-11-19 08:02:25,036 INFO L136 LiptonReduction]: Total number of compositions: 187 [2023-11-19 08:02:25,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:02:25,038 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@31ef58c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:02:25,038 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 08:02:25,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:02:25,040 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 08:02:25,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:25,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:25,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:25,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 08:02:25,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:25,041 INFO L85 PathProgramCache]: Analyzing trace with hash 40165, now seen corresponding path program 1 times [2023-11-19 08:02:25,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:25,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662398301] [2023-11-19 08:02:25,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:25,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:25,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:25,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:25,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662398301] [2023-11-19 08:02:25,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662398301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:25,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:25,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741476315] [2023-11-19 08:02:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:25,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:02:25,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:25,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:02:25,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:02:25,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 382 [2023-11-19 08:02:25,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 150 flow. Second operand has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:25,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:25,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 382 [2023-11-19 08:02:25,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:27,637 INFO L124 PetriNetUnfolderBase]: 14671/21929 cut-off events. [2023-11-19 08:02:27,638 INFO L125 PetriNetUnfolderBase]: For 931/931 co-relation queries the response was YES. [2023-11-19 08:02:27,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41972 conditions, 21929 events. 14671/21929 cut-off events. For 931/931 co-relation queries the response was YES. Maximal size of possible extension queue 1432. Compared 157418 event pairs, 12783 based on Foata normal form. 924/14250 useless extension candidates. Maximal degree in co-relation 2851. Up to 19564 conditions per place. [2023-11-19 08:02:27,915 INFO L140 encePairwiseOnDemand]: 374/382 looper letters, 39 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2023-11-19 08:02:27,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 204 flow [2023-11-19 08:02:27,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:02:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:02:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 373 transitions. [2023-11-19 08:02:27,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4882198952879581 [2023-11-19 08:02:27,918 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 373 transitions. [2023-11-19 08:02:27,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 373 transitions. [2023-11-19 08:02:27,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:27,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 373 transitions. [2023-11-19 08:02:27,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 186.5) internal successors, (373), 2 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:27,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 382.0) internal successors, (1146), 3 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:27,922 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 382.0) internal successors, (1146), 3 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:27,923 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 150 flow. Second operand 2 states and 373 transitions. [2023-11-19 08:02:27,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 204 flow [2023-11-19 08:02:27,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 202 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:27,927 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 124 flow [2023-11-19 08:02:27,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2023-11-19 08:02:27,929 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -5 predicate places. [2023-11-19 08:02:27,929 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 124 flow [2023-11-19 08:02:27,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:27,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:27,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:27,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 08:02:27,930 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 08:02:27,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash 40195, now seen corresponding path program 1 times [2023-11-19 08:02:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:27,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33942251] [2023-11-19 08:02:27,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:27,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33942251] [2023-11-19 08:02:27,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33942251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:27,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:27,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:27,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575111869] [2023-11-19 08:02:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:27,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:27,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:27,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:27,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 382 [2023-11-19 08:02:28,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:28,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:28,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 382 [2023-11-19 08:02:28,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:29,740 INFO L124 PetriNetUnfolderBase]: 10701/16215 cut-off events. [2023-11-19 08:02:29,740 INFO L125 PetriNetUnfolderBase]: For 609/609 co-relation queries the response was YES. [2023-11-19 08:02:29,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30956 conditions, 16215 events. 10701/16215 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 112945 event pairs, 9285 based on Foata normal form. 0/10398 useless extension candidates. Maximal degree in co-relation 30950. Up to 14370 conditions per place. [2023-11-19 08:02:29,876 INFO L140 encePairwiseOnDemand]: 380/382 looper letters, 37 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-11-19 08:02:29,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 53 transitions, 198 flow [2023-11-19 08:02:29,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2023-11-19 08:02:29,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4424083769633508 [2023-11-19 08:02:29,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2023-11-19 08:02:29,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2023-11-19 08:02:29,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:29,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2023-11-19 08:02:29,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:29,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:29,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:29,891 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 124 flow. Second operand 3 states and 507 transitions. [2023-11-19 08:02:29,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 53 transitions, 198 flow [2023-11-19 08:02:29,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:29,898 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 124 flow [2023-11-19 08:02:29,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-11-19 08:02:29,900 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2023-11-19 08:02:29,900 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 124 flow [2023-11-19 08:02:29,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:29,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:29,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-19 08:02:29,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 08:02:29,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 08:02:29,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:29,902 INFO L85 PathProgramCache]: Analyzing trace with hash 40196, now seen corresponding path program 1 times [2023-11-19 08:02:29,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:29,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659943999] [2023-11-19 08:02:29,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:29,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:29,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659943999] [2023-11-19 08:02:29,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659943999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:29,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:29,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121048027] [2023-11-19 08:02:29,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:29,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:29,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:29,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:29,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 382 [2023-11-19 08:02:29,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:29,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:29,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 382 [2023-11-19 08:02:29,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:31,379 INFO L124 PetriNetUnfolderBase]: 6731/10501 cut-off events. [2023-11-19 08:02:31,379 INFO L125 PetriNetUnfolderBase]: For 609/609 co-relation queries the response was YES. [2023-11-19 08:02:31,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20051 conditions, 10501 events. 6731/10501 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 69895 event pairs, 5787 based on Foata normal form. 0/7470 useless extension candidates. Maximal degree in co-relation 20044. Up to 9177 conditions per place. [2023-11-19 08:02:31,567 INFO L140 encePairwiseOnDemand]: 380/382 looper letters, 36 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-11-19 08:02:31,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 196 flow [2023-11-19 08:02:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2023-11-19 08:02:31,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4467713787085515 [2023-11-19 08:02:31,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2023-11-19 08:02:31,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2023-11-19 08:02:31,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:31,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2023-11-19 08:02:31,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:31,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:31,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:31,576 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 124 flow. Second operand 3 states and 512 transitions. [2023-11-19 08:02:31,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 196 flow [2023-11-19 08:02:31,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:31,580 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 123 flow [2023-11-19 08:02:31,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-11-19 08:02:31,580 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2023-11-19 08:02:31,581 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 123 flow [2023-11-19 08:02:31,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:31,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:31,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:02:31,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 08:02:31,582 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 08:02:31,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:31,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1198456038, now seen corresponding path program 1 times [2023-11-19 08:02:31,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:31,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071452266] [2023-11-19 08:02:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:31,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:31,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:31,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071452266] [2023-11-19 08:02:31,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071452266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:31,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:31,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:02:31,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140277718] [2023-11-19 08:02:31,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:31,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:31,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:31,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:02:31,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 382 [2023-11-19 08:02:31,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:31,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:31,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 382 [2023-11-19 08:02:31,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:32,362 INFO L124 PetriNetUnfolderBase]: 5059/7955 cut-off events. [2023-11-19 08:02:32,362 INFO L125 PetriNetUnfolderBase]: For 494/494 co-relation queries the response was YES. [2023-11-19 08:02:32,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15149 conditions, 7955 events. 5059/7955 cut-off events. For 494/494 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 50946 event pairs, 4281 based on Foata normal form. 0/6050 useless extension candidates. Maximal degree in co-relation 15142. Up to 6883 conditions per place. [2023-11-19 08:02:32,421 INFO L140 encePairwiseOnDemand]: 378/382 looper letters, 33 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2023-11-19 08:02:32,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 185 flow [2023-11-19 08:02:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-11-19 08:02:32,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4223385689354276 [2023-11-19 08:02:32,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-11-19 08:02:32,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-11-19 08:02:32,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:32,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-11-19 08:02:32,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:32,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:32,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:32,431 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 123 flow. Second operand 3 states and 484 transitions. [2023-11-19 08:02:32,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 185 flow [2023-11-19 08:02:32,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:32,436 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 118 flow [2023-11-19 08:02:32,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-11-19 08:02:32,437 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2023-11-19 08:02:32,437 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 118 flow [2023-11-19 08:02:32,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:32,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:32,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:02:32,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 08:02:32,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 08:02:32,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:32,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1198456039, now seen corresponding path program 1 times [2023-11-19 08:02:32,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:32,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136011518] [2023-11-19 08:02:32,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:32,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:32,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:32,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136011518] [2023-11-19 08:02:32,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136011518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:32,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:32,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:32,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825787521] [2023-11-19 08:02:32,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:32,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:02:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:32,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:02:32,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:32,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 382 [2023-11-19 08:02:32,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:32,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:32,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 382 [2023-11-19 08:02:32,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:34,167 INFO L124 PetriNetUnfolderBase]: 8613/13363 cut-off events. [2023-11-19 08:02:34,167 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2023-11-19 08:02:34,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25584 conditions, 13363 events. 8613/13363 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 90276 event pairs, 4687 based on Foata normal form. 0/10448 useless extension candidates. Maximal degree in co-relation 25577. Up to 6883 conditions per place. [2023-11-19 08:02:34,244 INFO L140 encePairwiseOnDemand]: 377/382 looper letters, 60 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-11-19 08:02:34,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 312 flow [2023-11-19 08:02:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:02:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 669 transitions. [2023-11-19 08:02:34,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43782722513089006 [2023-11-19 08:02:34,248 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 669 transitions. [2023-11-19 08:02:34,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 669 transitions. [2023-11-19 08:02:34,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:34,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 669 transitions. [2023-11-19 08:02:34,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:34,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 382.0) internal successors, (1910), 5 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:34,254 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 382.0) internal successors, (1910), 5 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:34,254 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 118 flow. Second operand 4 states and 669 transitions. [2023-11-19 08:02:34,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 312 flow [2023-11-19 08:02:34,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:34,257 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 133 flow [2023-11-19 08:02:34,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-11-19 08:02:34,258 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -3 predicate places. [2023-11-19 08:02:34,258 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 133 flow [2023-11-19 08:02:34,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:34,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:34,259 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:34,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 08:02:34,259 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 08:02:34,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1542369493, now seen corresponding path program 1 times [2023-11-19 08:02:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:34,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427515699] [2023-11-19 08:02:34,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 08:02:34,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:34,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427515699] [2023-11-19 08:02:34,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427515699] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:34,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455165381] [2023-11-19 08:02:34,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:34,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:34,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:34,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:34,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 08:02:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:34,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-19 08:02:34,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:02:34,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:02:34,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2023-11-19 08:02:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 08:02:34,576 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:02:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455165381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:34,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 08:02:34,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-11-19 08:02:34,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144997812] [2023-11-19 08:02:34,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:34,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:34,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:34,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:34,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:02:34,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 382 [2023-11-19 08:02:34,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:34,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:34,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 382 [2023-11-19 08:02:34,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:36,979 INFO L124 PetriNetUnfolderBase]: 14835/22942 cut-off events. [2023-11-19 08:02:36,979 INFO L125 PetriNetUnfolderBase]: For 2921/2921 co-relation queries the response was YES. [2023-11-19 08:02:37,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45589 conditions, 22942 events. 14835/22942 cut-off events. For 2921/2921 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 163089 event pairs, 7621 based on Foata normal form. 0/18520 useless extension candidates. Maximal degree in co-relation 45581. Up to 12073 conditions per place. [2023-11-19 08:02:37,140 INFO L140 encePairwiseOnDemand]: 377/382 looper letters, 61 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2023-11-19 08:02:37,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 340 flow [2023-11-19 08:02:37,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:02:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 688 transitions. [2023-11-19 08:02:37,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.450261780104712 [2023-11-19 08:02:37,144 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 688 transitions. [2023-11-19 08:02:37,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 688 transitions. [2023-11-19 08:02:37,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:37,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 688 transitions. [2023-11-19 08:02:37,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:37,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 382.0) internal successors, (1910), 5 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:37,152 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 382.0) internal successors, (1910), 5 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:37,152 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 133 flow. Second operand 4 states and 688 transitions. [2023-11-19 08:02:37,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 340 flow [2023-11-19 08:02:37,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:37,157 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 150 flow [2023-11-19 08:02:37,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2023-11-19 08:02:37,158 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2023-11-19 08:02:37,158 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 150 flow [2023-11-19 08:02:37,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:37,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:37,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:37,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 08:02:37,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:37,375 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 08:02:37,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1314664, now seen corresponding path program 1 times [2023-11-19 08:02:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:37,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333232170] [2023-11-19 08:02:37,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:37,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:37,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333232170] [2023-11-19 08:02:37,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333232170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:37,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:37,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:02:37,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497971446] [2023-11-19 08:02:37,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:37,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:37,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:37,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:37,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:37,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 382 [2023-11-19 08:02:37,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:37,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:37,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 382 [2023-11-19 08:02:37,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:42,491 INFO L124 PetriNetUnfolderBase]: 36054/51723 cut-off events. [2023-11-19 08:02:42,491 INFO L125 PetriNetUnfolderBase]: For 8179/8179 co-relation queries the response was YES. [2023-11-19 08:02:42,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111611 conditions, 51723 events. 36054/51723 cut-off events. For 8179/8179 co-relation queries the response was YES. Maximal size of possible extension queue 1788. Compared 368938 event pairs, 15639 based on Foata normal form. 0/43366 useless extension candidates. Maximal degree in co-relation 111602. Up to 31670 conditions per place. [2023-11-19 08:02:42,819 INFO L140 encePairwiseOnDemand]: 373/382 looper letters, 71 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2023-11-19 08:02:42,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 409 flow [2023-11-19 08:02:42,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2023-11-19 08:02:42,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4598603839441536 [2023-11-19 08:02:42,822 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2023-11-19 08:02:42,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2023-11-19 08:02:42,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:42,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2023-11-19 08:02:42,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:42,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:42,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 382.0) internal successors, (1528), 4 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:42,828 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 150 flow. Second operand 3 states and 527 transitions. [2023-11-19 08:02:42,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 409 flow [2023-11-19 08:02:42,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:42,839 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 199 flow [2023-11-19 08:02:42,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2023-11-19 08:02:42,840 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2023-11-19 08:02:42,841 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 199 flow [2023-11-19 08:02:42,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:42,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:42,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:42,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 08:02:42,842 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 08:02:42,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1263210513, now seen corresponding path program 1 times [2023-11-19 08:02:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:42,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841901641] [2023-11-19 08:02:42,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841901641] [2023-11-19 08:02:43,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841901641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106895102] [2023-11-19 08:02:43,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:43,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:43,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:43,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:43,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 08:02:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:43,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-19 08:02:43,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:02:43,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:02:43,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2023-11-19 08:02:43,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:43,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:02:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:02:43,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106895102] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:02:43,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:02:43,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-11-19 08:02:43,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261294530] [2023-11-19 08:02:43,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:02:43,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-19 08:02:43,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:43,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-19 08:02:43,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-19 08:02:44,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 382 [2023-11-19 08:02:44,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 199 flow. Second operand has 12 states, 12 states have (on average 150.5) internal successors, (1806), 12 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:44,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:44,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 382 [2023-11-19 08:02:44,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:47,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 22#L713true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:47,610 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-19 08:02:47,610 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:47,610 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:47,610 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:47,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 22#L713true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:47,824 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 08:02:47,824 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:47,825 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:47,825 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:47,825 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:47,825 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-19 08:02:47,825 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:47,825 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:47,825 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:48,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:48,251 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 08:02:48,251 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:48,251 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:48,251 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:48,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 38#L16true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:48,252 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 08:02:48,252 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:48,253 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:48,253 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:48,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 136#L713true, 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:48,254 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-19 08:02:48,254 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:48,254 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:48,254 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:48,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, 22#L713true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:48,396 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 08:02:48,396 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:48,397 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,397 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:48,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, 38#L16true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:48,498 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 08:02:48,498 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,498 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:48,498 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:48,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:48,499 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 08:02:48,499 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,499 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:48,499 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:48,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 148#L705-5true, 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:48,500 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-19 08:02:48,500 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,500 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:48,500 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 08:02:48,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 22#L713true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:48,613 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 08:02:48,613 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,613 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,614 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:48,614 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 08:02:48,614 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,614 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,615 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 148#L705-5true, 100#L713true, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:48,715 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 08:02:48,715 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,715 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 08:02:48,716 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:48,716 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 08:02:48,716 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,716 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,716 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 08:02:48,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:48,717 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 08:02:48,717 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 08:02:48,717 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,717 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:48,718 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-19 08:02:48,718 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:48,718 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-19 08:02:48,718 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:48,819 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:02:48,820 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,820 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,820 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:48,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 38#L16true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:48,820 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:02:48,820 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:48,821 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,821 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 136#L713true, 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:48,821 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:02:48,821 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,821 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:48,822 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:48,914 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:02:48,914 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 08:02:48,914 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:48,914 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:48,915 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:02:48,915 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:48,916 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,916 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 08:02:48,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:48,917 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:02:48,917 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:48,917 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:48,917 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 08:02:48,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 47#L707-1true, 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:48,918 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-19 08:02:48,918 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-19 08:02:48,918 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:48,918 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:49,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, 38#L16true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:49,228 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-19 08:02:49,228 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:49,228 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:49,228 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:49,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:49,229 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-19 08:02:49,229 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:49,229 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:49,229 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:49,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 148#L705-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,230 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-19 08:02:49,230 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:49,230 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:49,230 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:49,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 47#L707-1true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:49,308 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-19 08:02:49,308 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:49,308 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:49,308 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:49,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 148#L705-5true, 100#L713true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:49,407 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-19 08:02:49,407 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:49,407 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:49,407 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,408 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-19 08:02:49,408 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:49,408 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,408 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:49,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,408 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-19 08:02:49,409 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:49,409 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:49,409 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,409 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-19 08:02:49,409 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:49,410 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:49,410 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 22#L713true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,485 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-19 08:02:49,485 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:49,485 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,485 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:49,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:49,575 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-19 08:02:49,575 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,575 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,575 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:49,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:49,576 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-19 08:02:49,576 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:49,576 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,577 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,577 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,578 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-19 08:02:49,578 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,578 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,578 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:49,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 47#L707-1true, 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,579 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-19 08:02:49,579 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,579 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,579 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:49,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 22#L713true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,651 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-19 08:02:49,651 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,651 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,651 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,652 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-19 08:02:49,652 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,652 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:49,652 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][33], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 47#L707-1true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 333#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (= (mod |thr1Thread1of3ForFork0_findMax_~i~0#1| 2) 0) (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|))]) [2023-11-19 08:02:49,740 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-19 08:02:49,740 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-19 08:02:49,740 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,740 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:49,796 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,796 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-19 08:02:49,797 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:49,797 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,797 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 38#L16true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,798 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-19 08:02:49,798 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,798 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,799 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:49,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 136#L713true, 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,799 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-19 08:02:49,800 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:49,800 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,800 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:49,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 22#L713true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:49,906 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-19 08:02:49,906 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:49,906 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:49,907 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:50,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, 38#L16true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,166 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,166 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,166 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:50,166 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:50,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,168 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,168 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:50,168 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,168 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:50,169 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 100#L713true, 148#L705-5true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,170 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,170 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,170 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:50,170 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-19 08:02:50,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, 22#L713true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,271 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,271 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,271 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,271 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,272 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,272 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,272 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,272 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 148#L705-5true, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,328 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,328 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,328 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:50,328 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,329 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,329 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:50,329 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,329 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,330 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,330 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:50,331 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,331 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,331 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,332 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,332 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,332 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-19 08:02:50,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,413 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,413 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,413 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,413 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, 38#L16true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,414 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,414 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,414 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,414 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,415 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,415 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,415 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,415 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,458 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,458 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,458 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:50,458 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,459 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,459 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,459 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,459 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:50,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,460 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,460 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:50,460 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,460 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 47#L707-1true, 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,461 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,461 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,461 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-19 08:02:50,462 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, 38#L16true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,529 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,529 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,530 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,530 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,531 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,531 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,531 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,531 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 148#L705-5true, 100#L713true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,532 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,532 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:50,532 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,532 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 47#L707-1true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,568 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,568 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-19 08:02:50,568 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,568 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,628 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 148#L705-5true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,628 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-19 08:02:50,629 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,629 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,629 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:50,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,630 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-19 08:02:50,630 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,631 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,631 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:50,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,631 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-19 08:02:50,632 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,632 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,633 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:50,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,634 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-19 08:02:50,634 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-19 08:02:50,634 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,634 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 22#L713true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,654 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-19 08:02:50,655 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,655 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,655 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,704 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-19 08:02:50,704 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:50,704 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,704 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,705 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-19 08:02:50,705 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:50,705 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,705 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,706 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-19 08:02:50,706 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:50,706 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,706 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 47#L707-1true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,707 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-19 08:02:50,707 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-19 08:02:50,707 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,707 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 22#L713true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,722 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-19 08:02:50,723 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,723 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,723 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,724 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-19 08:02:50,724 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,724 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,724 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][87], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 47#L707-1true, 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 167#L714true, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 335#(and (= (select |#length| 3) 24) (= (mod (+ |thr1Thread1of3ForFork0_findMax_~i~0#1| 1) 2) 0) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 1 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,768 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-19 08:02:50,768 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:02:50,768 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,768 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:02:50,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,780 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-19 08:02:50,780 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,780 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:02:50,781 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 136#L713true, 38#L16true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,782 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-19 08:02:50,782 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,782 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:02:50,782 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,783 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-19 08:02:50,784 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,784 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:02:50,784 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,805 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 22#L713true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,806 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-19 08:02:50,806 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,806 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:02:50,806 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:02:50,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 148#L705-5true, 151#L727-5true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,816 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-19 08:02:50,816 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:02:50,816 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,816 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:02:50,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 167#L714true, 38#L16true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,817 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-19 08:02:50,817 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,817 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:02:50,817 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:02:50,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,818 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-19 08:02:50,818 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,818 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:02:50,818 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:02:50,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, 22#L713true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,833 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-19 08:02:50,833 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,834 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,834 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,835 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-19 08:02:50,835 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,835 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,835 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 148#L705-5true, 151#L727-5true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,841 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-19 08:02:50,841 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,841 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,841 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,842 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-19 08:02:50,842 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,842 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,842 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 151#L727-5true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,843 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-19 08:02:50,843 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,843 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,843 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,844 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-19 08:02:50,844 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,844 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:02:50,845 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:02:50,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 58#L714true, 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,856 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-19 08:02:50,856 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,856 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,856 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, 38#L16true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,857 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-19 08:02:50,857 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,857 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,858 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,858 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-19 08:02:50,858 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,859 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,859 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,861 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-19 08:02:50,861 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,861 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,861 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,862 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-19 08:02:50,862 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,862 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,863 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,863 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-19 08:02:50,863 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,864 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,864 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 47#L707-1true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,865 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-19 08:02:50,865 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:02:50,865 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:02:50,865 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 148#L705-5true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,873 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-19 08:02:50,873 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,873 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,873 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, 38#L16true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,874 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-19 08:02:50,874 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,874 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,874 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), 112#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,875 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-19 08:02:50,875 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,875 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,875 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 47#L707-1true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 151#L727-5true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,876 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-19 08:02:50,877 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,877 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:02:50,877 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:02:50,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 148#L705-5true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,882 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-11-19 08:02:50,882 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,882 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,882 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,883 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-11-19 08:02:50,883 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,884 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,884 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 100#L713true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,884 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-11-19 08:02:50,885 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,885 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,885 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 100#L713true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,886 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-11-19 08:02:50,886 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:02:50,886 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,886 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-19 08:02:50,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [14#thr1EXITtrue, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,888 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-11-19 08:02:50,888 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-19 08:02:50,888 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,888 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [88#L706-2true, 243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,889 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-11-19 08:02:50,890 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,890 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-19 08:02:50,890 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 71#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,891 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-11-19 08:02:50,892 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,892 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-19 08:02:50,892 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 47#L707-1true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 136#L713true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,893 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-11-19 08:02:50,893 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:02:50,893 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-19 08:02:50,894 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:02:50,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1021] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_69 1) 1 0) 0)) (= v_~m~0_68 0)) InVars {~m~0=v_~m~0_69} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_68, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][123], [243#(and (<= |thr1Thread2of3ForFork0_findMax_~i~0#1| 5) (= |~#storage~0.offset| 0) (= (mod |thr1Thread2of3ForFork0_findMax_~i~0#1| 2) 0) (<= 0 |thr1Thread2of3ForFork0_findMax_~i~0#1|) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 47#L707-1true, 186#true, 191#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 100#L713true, 246#true, 167#L714true, 337#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= 0 |thr1Thread1of3ForFork0_findMax_~i~0#1|) (<= |thr1Thread1of3ForFork0_findMax_~i~0#1| 5) (= 3 |~#storage~0.base|)), thr1Thread1of3ForFork0InUse, Black: 210#(and (= |thr1Thread1of3ForFork0_findMax_~i~0#1| |thr1Thread1of3ForFork0_findMax_~offset#1|) (<= 0 |thr1Thread1of3ForFork0_findMax_~offset#1|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (<= |thr1Thread1of3ForFork0_findMax_~offset#1| 5) (= (select |#length| |~#storage~0.base|) 24)), 195#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 21#L727-4true, Black: 248#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 202#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1))]) [2023-11-19 08:02:50,895 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-11-19 08:02:50,895 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:02:50,895 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2023-11-19 08:02:50,896 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-19 08:02:50,896 INFO L124 PetriNetUnfolderBase]: 42440/63395 cut-off events. [2023-11-19 08:02:50,896 INFO L125 PetriNetUnfolderBase]: For 17161/17644 co-relation queries the response was YES. [2023-11-19 08:02:51,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146885 conditions, 63395 events. 42440/63395 cut-off events. For 17161/17644 co-relation queries the response was YES. Maximal size of possible extension queue 1870. Compared 485946 event pairs, 8114 based on Foata normal form. 886/56151 useless extension candidates. Maximal degree in co-relation 146875. Up to 17276 conditions per place. [2023-11-19 08:02:51,398 INFO L140 encePairwiseOnDemand]: 376/382 looper letters, 119 selfloop transitions, 8 changer transitions 0/145 dead transitions. [2023-11-19 08:02:51,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 145 transitions, 723 flow [2023-11-19 08:02:51,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:02:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:02:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1004 transitions. [2023-11-19 08:02:51,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43804537521815007 [2023-11-19 08:02:51,405 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1004 transitions. [2023-11-19 08:02:51,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1004 transitions. [2023-11-19 08:02:51,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:51,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1004 transitions. [2023-11-19 08:02:51,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 167.33333333333334) internal successors, (1004), 6 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:51,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 382.0) internal successors, (2674), 7 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:51,415 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 382.0) internal successors, (2674), 7 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:51,415 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 199 flow. Second operand 6 states and 1004 transitions. [2023-11-19 08:02:51,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 145 transitions, 723 flow [2023-11-19 08:02:51,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 145 transitions, 705 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:51,652 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 238 flow [2023-11-19 08:02:51,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=382, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-11-19 08:02:51,653 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2023-11-19 08:02:51,654 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 238 flow [2023-11-19 08:02:51,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 150.5) internal successors, (1806), 12 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:51,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:51,655 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:51,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 08:02:51,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:51,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-19 08:02:51,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -27311062, now seen corresponding path program 1 times [2023-11-19 08:02:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:51,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735703553] [2023-11-19 08:02:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 08:02:52,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:52,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735703553] [2023-11-19 08:02:52,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735703553] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:52,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41657411] [2023-11-19 08:02:52,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:52,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:52,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:52,061 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:52,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f09ceac-44b4-456f-b65f-18e376e0ef1c/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 08:02:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:52,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-19 08:02:52,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:02:52,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:02:52,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2023-11-19 08:02:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 08:02:52,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:02:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41657411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:52,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 08:02:52,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-11-19 08:02:52,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158510030] [2023-11-19 08:02:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:52,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:52,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:52,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:02:52,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 382 [2023-11-19 08:02:52,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:52,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:52,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 382 [2023-11-19 08:02:52,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand