./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 e7bb482b 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_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:11:47,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:11:47,989 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:11:47,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:11:48,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:11:48,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:11:48,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:11:48,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:11:48,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:11:48,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:11:48,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:11:48,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:11:48,047 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:11:48,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:11:48,049 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:11:48,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:11:48,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:11:48,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:11:48,051 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:11:48,051 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:11:48,052 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:11:48,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:11:48,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:11:48,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:11:48,055 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:11:48,055 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:11:48,056 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:11:48,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:11:48,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:11:48,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:11:48,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:11:48,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:11:48,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:11:48,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:11:48,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:11:48,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:11:48,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:11:48,061 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:11:48,061 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_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/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_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 [2023-11-06 22:11:48,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:11:48,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:11:48,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:11:48,350 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:11:48,351 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:11:48,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2023-11-06 22:11:51,425 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:11:51,701 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:11:51,702 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2023-11-06 22:11:51,720 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/data/cee87b1ae/df566933057642e7aa6c952f6f4f0e72/FLAG21acda87a [2023-11-06 22:11:51,734 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/data/cee87b1ae/df566933057642e7aa6c952f6f4f0e72 [2023-11-06 22:11:51,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:11:51,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:11:51,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:11:51,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:11:51,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:11:51,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:11:51" (1/1) ... [2023-11-06 22:11:51,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301c311a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:51, skipping insertion in model container [2023-11-06 22:11:51,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:11:51" (1/1) ... [2023-11-06 22:11:51,795 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:11:52,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:11:52,231 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:11:52,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:11:52,331 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:11:52,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52 WrapperNode [2023-11-06 22:11:52,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:11:52,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:11:52,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:11:52,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:11:52,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (1/1) ... [2023-11-06 22:11:52,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (1/1) ... [2023-11-06 22:11:52,385 INFO L138 Inliner]: procedures = 171, calls = 25, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 80 [2023-11-06 22:11:52,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:11:52,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:11:52,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:11:52,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:11:52,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (1/1) ... [2023-11-06 22:11:52,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (1/1) ... [2023-11-06 22:11:52,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (1/1) ... [2023-11-06 22:11:52,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (1/1) ... [2023-11-06 22:11:52,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (1/1) ... [2023-11-06 22:11:52,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (1/1) ... [2023-11-06 22:11:52,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (1/1) ... [2023-11-06 22:11:52,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (1/1) ... [2023-11-06 22:11:52,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:11:52,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:11:52,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:11:52,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:11:52,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (1/1) ... [2023-11-06 22:11:52,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:11:52,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:52,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:11:52,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:11:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:11:52,511 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-06 22:11:52,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-06 22:11:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:11:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:11:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:11:52,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:11:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:11:52,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:11:52,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:11:52,515 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:11:52,679 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:11:52,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:11:52,887 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:11:52,971 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:11:52,978 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:11:52,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:11:52 BoogieIcfgContainer [2023-11-06 22:11:52,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:11:52,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:11:52,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:11:52,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:11:52,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:11:51" (1/3) ... [2023-11-06 22:11:52,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1464a97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:11:52, skipping insertion in model container [2023-11-06 22:11:52,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:52" (2/3) ... [2023-11-06 22:11:52,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1464a97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:11:52, skipping insertion in model container [2023-11-06 22:11:52,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:11:52" (3/3) ... [2023-11-06 22:11:52,992 INFO L112 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2023-11-06 22:11:53,008 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:11:53,008 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-06 22:11:53,008 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:11:53,077 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:11:53,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 89 transitions, 182 flow [2023-11-06 22:11:53,175 INFO L124 PetriNetUnfolderBase]: 8/105 cut-off events. [2023-11-06 22:11:53,176 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:11:53,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 105 events. 8/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 142 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 67. Up to 4 conditions per place. [2023-11-06 22:11:53,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 89 transitions, 182 flow [2023-11-06 22:11:53,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 89 transitions, 182 flow [2023-11-06 22:11:53,203 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:11:53,214 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 89 transitions, 182 flow [2023-11-06 22:11:53,217 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 89 transitions, 182 flow [2023-11-06 22:11:53,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 89 transitions, 182 flow [2023-11-06 22:11:53,250 INFO L124 PetriNetUnfolderBase]: 8/105 cut-off events. [2023-11-06 22:11:53,250 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:11:53,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 105 events. 8/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 142 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 67. Up to 4 conditions per place. [2023-11-06 22:11:53,255 INFO L119 LiptonReduction]: Number of co-enabled transitions 1862 [2023-11-06 22:11:56,653 INFO L134 LiptonReduction]: Checked pairs total: 2022 [2023-11-06 22:11:56,653 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-11-06 22:11:56,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:11:56,677 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;@3503d49c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:11:56,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-06 22:11:56,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:11:56,679 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:11:56,680 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:11:56,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:11:56,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:11:56,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-06 22:11:56,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash 14074, now seen corresponding path program 1 times [2023-11-06 22:11:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:56,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319938786] [2023-11-06 22:11:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:56,969 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-06 22:11:56,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319938786] [2023-11-06 22:11:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319938786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:56,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:56,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:11:56,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781275121] [2023-11-06 22:11:56,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:56,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:11:56,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:57,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:11:57,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:11:57,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 192 [2023-11-06 22:11:57,013 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-06 22:11:57,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:11:57,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 192 [2023-11-06 22:11:57,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:11:57,058 INFO L124 PetriNetUnfolderBase]: 21/51 cut-off events. [2023-11-06 22:11:57,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:11:57,060 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 133 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-06 22:11:57,062 INFO L140 encePairwiseOnDemand]: 189/192 looper letters, 11 selfloop transitions, 0 changer transitions 0/12 dead transitions. [2023-11-06 22:11:57,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 12 transitions, 50 flow [2023-11-06 22:11:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:11:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:11:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2023-11-06 22:11:57,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2023-11-06 22:11:57,081 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 172 transitions. [2023-11-06 22:11:57,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 172 transitions. [2023-11-06 22:11:57,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:11:57,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 172 transitions. [2023-11-06 22:11:57,089 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-06 22:11:57,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 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-06 22:11:57,102 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 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-06 22:11:57,104 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 34 flow. Second operand 2 states and 172 transitions. [2023-11-06 22:11:57,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 12 transitions, 50 flow [2023-11-06 22:11:57,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 12 transitions, 50 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:11:57,110 INFO L231 Difference]: Finished difference. Result has 15 places, 12 transitions, 28 flow [2023-11-06 22:11:57,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, 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-06 22:11:57,117 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -2 predicate places. [2023-11-06 22:11:57,117 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 12 transitions, 28 flow [2023-11-06 22:11:57,118 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-06 22:11:57,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:11:57,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:11:57,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:11:57,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-06 22:11:57,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash 14088, now seen corresponding path program 1 times [2023-11-06 22:11:57,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:57,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301805822] [2023-11-06 22:11:57,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:57,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:57,256 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-06 22:11:57,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:57,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301805822] [2023-11-06 22:11:57,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301805822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:57,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:57,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:11:57,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703331840] [2023-11-06 22:11:57,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:57,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:11:57,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:57,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:11:57,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:57,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 192 [2023-11-06 22:11:57,313 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-06 22:11:57,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:11:57,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 192 [2023-11-06 22:11:57,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:11:57,348 INFO L124 PetriNetUnfolderBase]: 16/40 cut-off events. [2023-11-06 22:11:57,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:11:57,349 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-06 22:11:57,349 INFO L140 encePairwiseOnDemand]: 190/192 looper letters, 9 selfloop transitions, 1 changer transitions 0/11 dead transitions. [2023-11-06 22:11:57,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 11 transitions, 46 flow [2023-11-06 22:11:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:11:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:11:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2023-11-06 22:11:57,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3940972222222222 [2023-11-06 22:11:57,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 227 transitions. [2023-11-06 22:11:57,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 227 transitions. [2023-11-06 22:11:57,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:11:57,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 227 transitions. [2023-11-06 22:11:57,358 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-06 22:11:57,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 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-06 22:11:57,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 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-06 22:11:57,362 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 28 flow. Second operand 3 states and 227 transitions. [2023-11-06 22:11:57,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 11 transitions, 46 flow [2023-11-06 22:11:57,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 11 transitions, 46 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:11:57,363 INFO L231 Difference]: Finished difference. Result has 16 places, 11 transitions, 28 flow [2023-11-06 22:11:57,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, 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-06 22:11:57,364 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-11-06 22:11:57,364 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 11 transitions, 28 flow [2023-11-06 22:11:57,365 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-06 22:11:57,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:11:57,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:11:57,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:11:57,365 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-06 22:11:57,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:57,366 INFO L85 PathProgramCache]: Analyzing trace with hash 14089, now seen corresponding path program 1 times [2023-11-06 22:11:57,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:57,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30406534] [2023-11-06 22:11:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:57,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:57,499 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-06 22:11:57,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:57,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30406534] [2023-11-06 22:11:57,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30406534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:57,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:57,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:11:57,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711083538] [2023-11-06 22:11:57,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:57,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:11:57,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:57,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:11:57,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:11:57,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 192 [2023-11-06 22:11:57,538 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-06 22:11:57,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:11:57,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 192 [2023-11-06 22:11:57,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:11:57,561 INFO L124 PetriNetUnfolderBase]: 11/29 cut-off events. [2023-11-06 22:11:57,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:11:57,562 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-06 22:11:57,562 INFO L140 encePairwiseOnDemand]: 190/192 looper letters, 8 selfloop transitions, 1 changer transitions 0/10 dead transitions. [2023-11-06 22:11:57,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 10 transitions, 44 flow [2023-11-06 22:11:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:11:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:11:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2023-11-06 22:11:57,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2023-11-06 22:11:57,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 232 transitions. [2023-11-06 22:11:57,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 232 transitions. [2023-11-06 22:11:57,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:11:57,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 232 transitions. [2023-11-06 22:11:57,567 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-06 22:11:57,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 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-06 22:11:57,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 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-06 22:11:57,570 INFO L175 Difference]: Start difference. First operand has 16 places, 11 transitions, 28 flow. Second operand 3 states and 232 transitions. [2023-11-06 22:11:57,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 10 transitions, 44 flow [2023-11-06 22:11:57,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 10 transitions, 43 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:11:57,571 INFO L231 Difference]: Finished difference. Result has 16 places, 10 transitions, 27 flow [2023-11-06 22:11:57,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, 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-06 22:11:57,573 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-11-06 22:11:57,573 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 10 transitions, 27 flow [2023-11-06 22:11:57,574 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-06 22:11:57,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:11:57,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:11:57,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:11:57,575 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-06 22:11:57,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 419974819, now seen corresponding path program 1 times [2023-11-06 22:11:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653422329] [2023-11-06 22:11:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:57,784 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-06 22:11:57,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:57,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653422329] [2023-11-06 22:11:57,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653422329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:57,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:57,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:11:57,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29616034] [2023-11-06 22:11:57,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:57,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:11:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:57,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:11:57,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:11:57,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 192 [2023-11-06 22:11:57,865 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-06 22:11:57,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:11:57,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 192 [2023-11-06 22:11:57,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:11:57,898 INFO L124 PetriNetUnfolderBase]: 9/24 cut-off events. [2023-11-06 22:11:57,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:11:57,899 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-06 22:11:57,899 INFO L140 encePairwiseOnDemand]: 190/192 looper letters, 7 selfloop transitions, 1 changer transitions 0/9 dead transitions. [2023-11-06 22:11:57,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 9 transitions, 41 flow [2023-11-06 22:11:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:11:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:11:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2023-11-06 22:11:57,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2023-11-06 22:11:57,901 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions. [2023-11-06 22:11:57,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions. [2023-11-06 22:11:57,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:11:57,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions. [2023-11-06 22:11:57,923 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-06 22:11:57,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 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-06 22:11:57,926 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 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-06 22:11:57,926 INFO L175 Difference]: Start difference. First operand has 16 places, 10 transitions, 27 flow. Second operand 3 states and 216 transitions. [2023-11-06 22:11:57,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 9 transitions, 41 flow [2023-11-06 22:11:57,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-06 22:11:57,927 INFO L231 Difference]: Finished difference. Result has 16 places, 9 transitions, 26 flow [2023-11-06 22:11:57,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, 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-06 22:11:57,928 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -1 predicate places. [2023-11-06 22:11:57,928 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 9 transitions, 26 flow [2023-11-06 22:11:57,929 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-06 22:11:57,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:11:57,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:11:57,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:11:57,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2023-11-06 22:11:57,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash 419974820, now seen corresponding path program 1 times [2023-11-06 22:11:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:57,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943988087] [2023-11-06 22:11:57,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:11:58,089 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-06 22:11:58,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:11:58,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943988087] [2023-11-06 22:11:58,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943988087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:58,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:58,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:11:58,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558459850] [2023-11-06 22:11:58,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:58,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:11:58,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:11:58,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:11:58,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:11:58,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 192 [2023-11-06 22:11:58,244 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-06 22:11:58,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:11:58,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 192 [2023-11-06 22:11:58,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:11:58,296 INFO L124 PetriNetUnfolderBase]: 14/32 cut-off events. [2023-11-06 22:11:58,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:11:58,297 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-06 22:11:58,297 INFO L140 encePairwiseOnDemand]: 187/192 looper letters, 8 selfloop transitions, 4 changer transitions 0/13 dead transitions. [2023-11-06 22:11:58,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 13 transitions, 58 flow [2023-11-06 22:11:58,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:11:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:11:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2023-11-06 22:11:58,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3658854166666667 [2023-11-06 22:11:58,310 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 281 transitions. [2023-11-06 22:11:58,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 281 transitions. [2023-11-06 22:11:58,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:11:58,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 281 transitions. [2023-11-06 22:11:58,312 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-06 22:11:58,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 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-06 22:11:58,315 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 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-06 22:11:58,315 INFO L175 Difference]: Start difference. First operand has 16 places, 9 transitions, 26 flow. Second operand 4 states and 281 transitions. [2023-11-06 22:11:58,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 13 transitions, 58 flow [2023-11-06 22:11:58,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 13 transitions, 57 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:11:58,317 INFO L231 Difference]: Finished difference. Result has 19 places, 11 transitions, 46 flow [2023-11-06 22:11:58,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, 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-06 22:11:58,318 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, 2 predicate places. [2023-11-06 22:11:58,318 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 11 transitions, 46 flow [2023-11-06 22:11:58,318 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-06 22:11:58,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:11:58,319 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-06 22:11:58,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:11:58,319 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-06 22:11:58,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:58,320 INFO L85 PathProgramCache]: Analyzing trace with hash 134244400, now seen corresponding path program 1 times [2023-11-06 22:11:58,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:11:58,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345553880] [2023-11-06 22:11:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:11:58,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:11:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:11:58,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:11:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:11:58,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:11:58,384 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:11:58,385 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2023-11-06 22:11:58,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2023-11-06 22:11:58,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-06 22:11:58,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2023-11-06 22:11:58,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-06 22:11:58,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-06 22:11:58,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-06 22:11:58,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2023-11-06 22:11:58,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2023-11-06 22:11:58,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-06 22:11:58,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:11:58,394 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 22:11:58,398 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:11:58,399 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-06 22:11:58,451 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:11:58,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 139 transitions, 288 flow [2023-11-06 22:11:58,511 INFO L124 PetriNetUnfolderBase]: 15/173 cut-off events. [2023-11-06 22:11:58,511 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:11:58,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 173 events. 15/173 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 387 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 116. Up to 6 conditions per place. [2023-11-06 22:11:58,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 139 transitions, 288 flow [2023-11-06 22:11:58,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 139 transitions, 288 flow [2023-11-06 22:11:58,521 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:11:58,521 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 139 transitions, 288 flow [2023-11-06 22:11:58,522 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 139 transitions, 288 flow [2023-11-06 22:11:58,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 139 transitions, 288 flow [2023-11-06 22:11:58,560 INFO L124 PetriNetUnfolderBase]: 15/173 cut-off events. [2023-11-06 22:11:58,560 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:11:58,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 173 events. 15/173 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 387 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 116. Up to 6 conditions per place. [2023-11-06 22:11:58,570 INFO L119 LiptonReduction]: Number of co-enabled transitions 8624 [2023-11-06 22:12:01,547 INFO L134 LiptonReduction]: Checked pairs total: 13862 [2023-11-06 22:12:01,547 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-11-06 22:12:01,549 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:12:01,550 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;@3503d49c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:12:01,550 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:12:01,552 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:12:01,552 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:12:01,553 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:12:01,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:01,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:12:01,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-06 22:12:01,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash 24625, now seen corresponding path program 1 times [2023-11-06 22:12:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:01,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981463727] [2023-11-06 22:12:01,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:01,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,631 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-06 22:12:01,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:01,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981463727] [2023-11-06 22:12:01,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981463727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:01,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:01,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:12:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661386880] [2023-11-06 22:12:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:01,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:12:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:01,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:12:01,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:01,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 280 [2023-11-06 22:12:01,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 80 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-06 22:12:01,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:01,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 280 [2023-11-06 22:12:01,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:01,821 INFO L124 PetriNetUnfolderBase]: 463/822 cut-off events. [2023-11-06 22:12:01,822 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-06 22:12:01,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 822 events. 463/822 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4614 event pairs, 376 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 317. Up to 706 conditions per place. [2023-11-06 22:12:01,830 INFO L140 encePairwiseOnDemand]: 276/280 looper letters, 22 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2023-11-06 22:12:01,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 120 flow [2023-11-06 22:12:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-11-06 22:12:01,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4452380952380952 [2023-11-06 22:12:01,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-11-06 22:12:01,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-11-06 22:12:01,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:01,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-11-06 22:12:01,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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-06 22:12:01,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06 22:12:01,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06 22:12:01,840 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 80 flow. Second operand 3 states and 374 transitions. [2023-11-06 22:12:01,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 120 flow [2023-11-06 22:12:01,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:12:01,842 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 76 flow [2023-11-06 22:12:01,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2023-11-06 22:12:01,847 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-11-06 22:12:01,848 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 76 flow [2023-11-06 22:12:01,848 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-06 22:12:01,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:01,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:12:01,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:12:01,852 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-06 22:12:01,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash 24624, now seen corresponding path program 1 times [2023-11-06 22:12:01,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:01,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179298808] [2023-11-06 22:12:01,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:01,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:01,890 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-06 22:12:01,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179298808] [2023-11-06 22:12:01,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179298808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:01,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:01,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:12:01,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998087829] [2023-11-06 22:12:01,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:01,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:12:01,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:01,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:12:01,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:01,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 280 [2023-11-06 22:12:01,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 76 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-06 22:12:01,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:01,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 280 [2023-11-06 22:12:01,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:02,016 INFO L124 PetriNetUnfolderBase]: 282/530 cut-off events. [2023-11-06 22:12:02,016 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-06 22:12:02,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 530 events. 282/530 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2688 event pairs, 224 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 1001. Up to 444 conditions per place. [2023-11-06 22:12:02,021 INFO L140 encePairwiseOnDemand]: 278/280 looper letters, 21 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-11-06 22:12:02,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 118 flow [2023-11-06 22:12:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-11-06 22:12:02,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2023-11-06 22:12:02,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-11-06 22:12:02,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-11-06 22:12:02,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:02,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-11-06 22:12:02,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-06 22:12:02,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06 22:12:02,031 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06 22:12:02,032 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 76 flow. Second operand 3 states and 365 transitions. [2023-11-06 22:12:02,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 118 flow [2023-11-06 22:12:02,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:02,034 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 75 flow [2023-11-06 22:12:02,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2023-11-06 22:12:02,036 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2023-11-06 22:12:02,036 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 75 flow [2023-11-06 22:12:02,037 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-06 22:12:02,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:02,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:12:02,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:12:02,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-06 22:12:02,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash 734143036, now seen corresponding path program 1 times [2023-11-06 22:12:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:02,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408251510] [2023-11-06 22:12:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:02,152 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-06 22:12:02,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:02,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408251510] [2023-11-06 22:12:02,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408251510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:02,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:02,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:12:02,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566374232] [2023-11-06 22:12:02,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:02,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:12:02,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:02,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:12:02,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:12:02,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 280 [2023-11-06 22:12:02,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 75 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-06 22:12:02,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:02,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 280 [2023-11-06 22:12:02,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:02,361 INFO L124 PetriNetUnfolderBase]: 227/432 cut-off events. [2023-11-06 22:12:02,362 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-11-06 22:12:02,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 432 events. 227/432 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2058 event pairs, 175 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 811. Up to 355 conditions per place. [2023-11-06 22:12:02,366 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 19 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-11-06 22:12:02,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 111 flow [2023-11-06 22:12:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-11-06 22:12:02,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4154761904761905 [2023-11-06 22:12:02,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-11-06 22:12:02,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-11-06 22:12:02,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:02,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-11-06 22:12:02,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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-06 22:12:02,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06 22:12:02,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06 22:12:02,373 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 75 flow. Second operand 3 states and 349 transitions. [2023-11-06 22:12:02,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 111 flow [2023-11-06 22:12:02,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:02,375 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 72 flow [2023-11-06 22:12:02,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2023-11-06 22:12:02,376 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2023-11-06 22:12:02,376 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 72 flow [2023-11-06 22:12:02,377 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-06 22:12:02,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:02,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:12:02,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:12:02,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-06 22:12:02,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash 734143035, now seen corresponding path program 1 times [2023-11-06 22:12:02,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:02,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806281089] [2023-11-06 22:12:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:02,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:02,525 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-06 22:12:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:02,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806281089] [2023-11-06 22:12:02,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806281089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:02,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:02,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:12:02,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948878250] [2023-11-06 22:12:02,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:02,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:12:02,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:02,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:12:02,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:12:02,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 280 [2023-11-06 22:12:02,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 72 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-06 22:12:02,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:02,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 280 [2023-11-06 22:12:02,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:02,832 INFO L124 PetriNetUnfolderBase]: 377/697 cut-off events. [2023-11-06 22:12:02,832 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-06 22:12:02,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 697 events. 377/697 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3702 event pairs, 175 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 1311. Up to 355 conditions per place. [2023-11-06 22:12:02,838 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 32 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-11-06 22:12:02,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 177 flow [2023-11-06 22:12:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:12:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:12:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-11-06 22:12:02,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42232142857142857 [2023-11-06 22:12:02,842 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-11-06 22:12:02,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-11-06 22:12:02,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:02,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-11-06 22:12:02,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 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-06 22:12:02,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 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-06 22:12:02,847 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 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-06 22:12:02,847 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 72 flow. Second operand 4 states and 473 transitions. [2023-11-06 22:12:02,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 177 flow [2023-11-06 22:12:02,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:02,849 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 87 flow [2023-11-06 22:12:02,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-11-06 22:12:02,850 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-11-06 22:12:02,851 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 87 flow [2023-11-06 22:12:02,851 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-06 22:12:02,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:02,851 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:02,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:12:02,852 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-06 22:12:02,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:02,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1732552668, now seen corresponding path program 1 times [2023-11-06 22:12:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:02,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033496813] [2023-11-06 22:12:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:02,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:03,016 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-06 22:12:03,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:03,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033496813] [2023-11-06 22:12:03,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033496813] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:03,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743021662] [2023-11-06 22:12:03,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:03,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:03,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:03,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:03,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:12:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:03,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:12:03,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:03,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:12:03,196 INFO L351 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-06 22:12:03,305 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-06 22:12:03,305 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:12:03,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743021662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:03,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:12:03,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-11-06 22:12:03,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343696085] [2023-11-06 22:12:03,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:03,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:12:03,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:03,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:12:03,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:12:03,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 280 [2023-11-06 22:12:03,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 87 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-06 22:12:03,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:03,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 280 [2023-11-06 22:12:03,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:03,596 INFO L124 PetriNetUnfolderBase]: 622/1129 cut-off events. [2023-11-06 22:12:03,596 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2023-11-06 22:12:03,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 1129 events. 622/1129 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6118 event pairs, 295 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 2262. Up to 601 conditions per place. [2023-11-06 22:12:03,607 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 33 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-11-06 22:12:03,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 205 flow [2023-11-06 22:12:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:12:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:12:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-11-06 22:12:03,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2023-11-06 22:12:03,611 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-11-06 22:12:03,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-11-06 22:12:03,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:03,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-11-06 22:12:03,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 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-06 22:12:03,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 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-06 22:12:03,617 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 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-06 22:12:03,617 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 87 flow. Second operand 4 states and 492 transitions. [2023-11-06 22:12:03,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 205 flow [2023-11-06 22:12:03,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:12:03,620 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 104 flow [2023-11-06 22:12:03,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-11-06 22:12:03,621 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-11-06 22:12:03,621 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 104 flow [2023-11-06 22:12:03,621 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-06 22:12:03,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:03,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:03,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:03,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:12:03,828 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-06 22:12:03,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1596149752, now seen corresponding path program 1 times [2023-11-06 22:12:03,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:03,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119809249] [2023-11-06 22:12:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:03,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:03,858 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-06 22:12:03,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:03,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119809249] [2023-11-06 22:12:03,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119809249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:03,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:03,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:12:03,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621590154] [2023-11-06 22:12:03,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:03,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:12:03,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:03,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:12:03,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:03,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 280 [2023-11-06 22:12:03,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-06 22:12:03,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:03,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 280 [2023-11-06 22:12:03,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:04,166 INFO L124 PetriNetUnfolderBase]: 1076/1780 cut-off events. [2023-11-06 22:12:04,166 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2023-11-06 22:12:04,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4064 conditions, 1780 events. 1076/1780 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9872 event pairs, 460 based on Foata normal form. 56/1626 useless extension candidates. Maximal degree in co-relation 4051. Up to 1101 conditions per place. [2023-11-06 22:12:04,184 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 39 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-11-06 22:12:04,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 262 flow [2023-11-06 22:12:04,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-11-06 22:12:04,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2023-11-06 22:12:04,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-11-06 22:12:04,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-11-06 22:12:04,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:04,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-11-06 22:12:04,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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-06 22:12:04,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06 22:12:04,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 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-06 22:12:04,192 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 104 flow. Second operand 3 states and 371 transitions. [2023-11-06 22:12:04,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 262 flow [2023-11-06 22:12:04,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:12:04,195 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 155 flow [2023-11-06 22:12:04,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-11-06 22:12:04,196 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-11-06 22:12:04,196 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 155 flow [2023-11-06 22:12:04,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-06 22:12:04,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:04,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:04,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:12:04,197 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2023-11-06 22:12:04,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2058963461, now seen corresponding path program 1 times [2023-11-06 22:12:04,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:04,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753206487] [2023-11-06 22:12:04,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:04,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:04,489 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-06 22:12:04,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:04,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753206487] [2023-11-06 22:12:04,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753206487] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:04,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650702864] [2023-11-06 22:12:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:04,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:04,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:04,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:04,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:12:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:04,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:12:04,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:04,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:12:04,618 INFO L351 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-06 22:12:04,893 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-06 22:12:04,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:05,051 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-06 22:12:05,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650702864] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:05,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:05,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2023-11-06 22:12:05,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464136159] [2023-11-06 22:12:05,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:05,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:12:05,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:05,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:12:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:12:05,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 280 [2023-11-06 22:12:05,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 155 flow. Second operand has 13 states, 13 states have (on average 108.07692307692308) internal successors, (1405), 13 states have internal predecessors, (1405), 0 states have call successors, (0), 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-06 22:12:05,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:05,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 280 [2023-11-06 22:12:05,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:06,297 INFO L124 PetriNetUnfolderBase]: 1300/2235 cut-off events. [2023-11-06 22:12:06,297 INFO L125 PetriNetUnfolderBase]: For 1380/1412 co-relation queries the response was YES. [2023-11-06 22:12:06,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5849 conditions, 2235 events. 1300/2235 cut-off events. For 1380/1412 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12971 event pairs, 279 based on Foata normal form. 50/2173 useless extension candidates. Maximal degree in co-relation 5836. Up to 522 conditions per place. [2023-11-06 22:12:06,322 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 64 selfloop transitions, 12 changer transitions 0/86 dead transitions. [2023-11-06 22:12:06,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 86 transitions, 488 flow [2023-11-06 22:12:06,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:12:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:12:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 698 transitions. [2023-11-06 22:12:06,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4154761904761905 [2023-11-06 22:12:06,327 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 698 transitions. [2023-11-06 22:12:06,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 698 transitions. [2023-11-06 22:12:06,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:06,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 698 transitions. [2023-11-06 22:12:06,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 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-06 22:12:06,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 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-06 22:12:06,336 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 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-06 22:12:06,336 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 155 flow. Second operand 6 states and 698 transitions. [2023-11-06 22:12:06,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 86 transitions, 488 flow [2023-11-06 22:12:06,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 86 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:12:06,347 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 223 flow [2023-11-06 22:12:06,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-11-06 22:12:06,348 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2023-11-06 22:12:06,349 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 223 flow [2023-11-06 22:12:06,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 108.07692307692308) internal successors, (1405), 13 states have internal predecessors, (1405), 0 states have call successors, (0), 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-06 22:12:06,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:06,350 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-06 22:12:06,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:06,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:12:06,561 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-06 22:12:06,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1472924786, now seen corresponding path program 1 times [2023-11-06 22:12:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:06,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396631662] [2023-11-06 22:12:06,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:06,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:12:06,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:12:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:12:06,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:12:06,601 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:12:06,601 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2023-11-06 22:12:06,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2023-11-06 22:12:06,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:12:06,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2023-11-06 22:12:06,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:12:06,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:12:06,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2023-11-06 22:12:06,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:12:06,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2023-11-06 22:12:06,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2023-11-06 22:12:06,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2023-11-06 22:12:06,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2023-11-06 22:12:06,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:12:06,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:12:06,604 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:06,605 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:12:06,605 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-06 22:12:06,645 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:12:06,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions, 396 flow [2023-11-06 22:12:06,687 INFO L124 PetriNetUnfolderBase]: 22/241 cut-off events. [2023-11-06 22:12:06,687 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-06 22:12:06,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 241 events. 22/241 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 713 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. [2023-11-06 22:12:06,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 189 transitions, 396 flow [2023-11-06 22:12:06,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 189 transitions, 396 flow [2023-11-06 22:12:06,693 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:12:06,693 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 189 transitions, 396 flow [2023-11-06 22:12:06,694 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 189 transitions, 396 flow [2023-11-06 22:12:06,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 189 transitions, 396 flow [2023-11-06 22:12:06,732 INFO L124 PetriNetUnfolderBase]: 22/241 cut-off events. [2023-11-06 22:12:06,732 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-06 22:12:06,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 241 events. 22/241 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 713 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. [2023-11-06 22:12:06,750 INFO L119 LiptonReduction]: Number of co-enabled transitions 20286 [2023-11-06 22:12:10,471 INFO L134 LiptonReduction]: Checked pairs total: 33703 [2023-11-06 22:12:10,472 INFO L136 LiptonReduction]: Total number of compositions: 199 [2023-11-06 22:12:10,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:12:10,474 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;@3503d49c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:12:10,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:12:10,476 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:12:10,476 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:12:10,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:12:10,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:10,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:12:10,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:10,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash 38566, now seen corresponding path program 1 times [2023-11-06 22:12:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:10,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13117276] [2023-11-06 22:12:10,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:10,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,488 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-06 22:12:10,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:10,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13117276] [2023-11-06 22:12:10,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13117276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:10,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:10,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:12:10,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223942274] [2023-11-06 22:12:10,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:10,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:12:10,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:10,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:12:10,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:12:10,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 388 [2023-11-06 22:12:10,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 114 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-06 22:12:10,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:10,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 388 [2023-11-06 22:12:10,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:11,976 INFO L124 PetriNetUnfolderBase]: 9068/13310 cut-off events. [2023-11-06 22:12:11,976 INFO L125 PetriNetUnfolderBase]: For 703/703 co-relation queries the response was YES. [2023-11-06 22:12:12,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25652 conditions, 13310 events. 9068/13310 cut-off events. For 703/703 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 88615 event pairs, 7656 based on Foata normal form. 0/7013 useless extension candidates. Maximal degree in co-relation 2121. Up to 11985 conditions per place. [2023-11-06 22:12:12,195 INFO L140 encePairwiseOnDemand]: 386/388 looper letters, 34 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2023-11-06 22:12:12,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 178 flow [2023-11-06 22:12:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:12:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:12:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 362 transitions. [2023-11-06 22:12:12,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46649484536082475 [2023-11-06 22:12:12,198 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 362 transitions. [2023-11-06 22:12:12,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 362 transitions. [2023-11-06 22:12:12,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:12,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 362 transitions. [2023-11-06 22:12:12,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 181.0) internal successors, (362), 2 states have internal predecessors, (362), 0 states have call successors, (0), 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-06 22:12:12,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 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-06 22:12:12,203 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 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-06 22:12:12,204 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 114 flow. Second operand 2 states and 362 transitions. [2023-11-06 22:12:12,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 178 flow [2023-11-06 22:12:12,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 176 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-06 22:12:12,207 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 108 flow [2023-11-06 22:12:12,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-11-06 22:12:12,209 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-11-06 22:12:12,209 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 108 flow [2023-11-06 22:12:12,210 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-06 22:12:12,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:12,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:12:12,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:12:12,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:12,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:12,211 INFO L85 PathProgramCache]: Analyzing trace with hash 38562, now seen corresponding path program 1 times [2023-11-06 22:12:12,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:12,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072445250] [2023-11-06 22:12:12,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:12,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:12,234 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-06 22:12:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:12,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072445250] [2023-11-06 22:12:12,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072445250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:12,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:12,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:12:12,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338213972] [2023-11-06 22:12:12,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:12,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:12:12,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:12,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:12:12,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:12,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 388 [2023-11-06 22:12:12,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 108 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-06 22:12:12,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:12,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 388 [2023-11-06 22:12:12,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:13,473 INFO L124 PetriNetUnfolderBase]: 6619/9859 cut-off events. [2023-11-06 22:12:13,473 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2023-11-06 22:12:13,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18943 conditions, 9859 events. 6619/9859 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 63501 event pairs, 5560 based on Foata normal form. 0/5521 useless extension candidates. Maximal degree in co-relation 18937. Up to 8806 conditions per place. [2023-11-06 22:12:13,551 INFO L140 encePairwiseOnDemand]: 386/388 looper letters, 32 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-11-06 22:12:13,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 172 flow [2023-11-06 22:12:13,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2023-11-06 22:12:13,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43127147766323026 [2023-11-06 22:12:13,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2023-11-06 22:12:13,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2023-11-06 22:12:13,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:13,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2023-11-06 22:12:13,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 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-06 22:12:13,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06 22:12:13,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06 22:12:13,560 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 108 flow. Second operand 3 states and 502 transitions. [2023-11-06 22:12:13,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 172 flow [2023-11-06 22:12:13,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:12:13,562 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 108 flow [2023-11-06 22:12:13,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-11-06 22:12:13,564 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-11-06 22:12:13,564 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 108 flow [2023-11-06 22:12:13,564 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-06 22:12:13,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:13,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:12:13,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:12:13,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:13,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:13,565 INFO L85 PathProgramCache]: Analyzing trace with hash 38561, now seen corresponding path program 1 times [2023-11-06 22:12:13,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:13,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132270269] [2023-11-06 22:12:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:13,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:13,609 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-06 22:12:13,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132270269] [2023-11-06 22:12:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132270269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:13,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:13,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:12:13,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68466469] [2023-11-06 22:12:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:13,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:12:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:13,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:12:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:13,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 388 [2023-11-06 22:12:13,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 108 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-06 22:12:13,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:13,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 388 [2023-11-06 22:12:13,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:14,321 INFO L124 PetriNetUnfolderBase]: 4170/6408 cut-off events. [2023-11-06 22:12:14,321 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2023-11-06 22:12:14,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12316 conditions, 6408 events. 4170/6408 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 39608 event pairs, 3464 based on Foata normal form. 0/4029 useless extension candidates. Maximal degree in co-relation 12309. Up to 5628 conditions per place. [2023-11-06 22:12:14,374 INFO L140 encePairwiseOnDemand]: 386/388 looper letters, 31 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-11-06 22:12:14,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 170 flow [2023-11-06 22:12:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2023-11-06 22:12:14,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43556701030927836 [2023-11-06 22:12:14,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2023-11-06 22:12:14,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2023-11-06 22:12:14,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:14,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2023-11-06 22:12:14,380 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-06 22:12:14,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06 22:12:14,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06 22:12:14,383 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 108 flow. Second operand 3 states and 507 transitions. [2023-11-06 22:12:14,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 170 flow [2023-11-06 22:12:14,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:14,388 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 107 flow [2023-11-06 22:12:14,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-11-06 22:12:14,390 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-11-06 22:12:14,390 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 107 flow [2023-11-06 22:12:14,390 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-06 22:12:14,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:14,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:12:14,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:12:14,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:14,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:14,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1149807760, now seen corresponding path program 1 times [2023-11-06 22:12:14,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:14,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483312495] [2023-11-06 22:12:14,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:14,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:14,524 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-06 22:12:14,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:14,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483312495] [2023-11-06 22:12:14,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483312495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:14,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:14,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:12:14,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720524116] [2023-11-06 22:12:14,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:14,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:12:14,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:14,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:12:14,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:12:14,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 388 [2023-11-06 22:12:14,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 107 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-06 22:12:14,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:14,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 388 [2023-11-06 22:12:14,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:15,988 INFO L124 PetriNetUnfolderBase]: 7010/10620 cut-off events. [2023-11-06 22:12:15,989 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2023-11-06 22:12:16,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20459 conditions, 10620 events. 7010/10620 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 70867 event pairs, 3464 based on Foata normal form. 0/6788 useless extension candidates. Maximal degree in co-relation 20452. Up to 5628 conditions per place. [2023-11-06 22:12:16,090 INFO L140 encePairwiseOnDemand]: 383/388 looper letters, 56 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-11-06 22:12:16,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 289 flow [2023-11-06 22:12:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:12:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:12:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2023-11-06 22:12:16,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42847938144329895 [2023-11-06 22:12:16,094 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 665 transitions. [2023-11-06 22:12:16,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 665 transitions. [2023-11-06 22:12:16,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:16,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 665 transitions. [2023-11-06 22:12:16,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 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-06 22:12:16,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 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-06 22:12:16,103 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 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-06 22:12:16,103 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 107 flow. Second operand 4 states and 665 transitions. [2023-11-06 22:12:16,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 289 flow [2023-11-06 22:12:16,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:16,108 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 122 flow [2023-11-06 22:12:16,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-11-06 22:12:16,109 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2023-11-06 22:12:16,109 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 122 flow [2023-11-06 22:12:16,110 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-06 22:12:16,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:16,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:12:16,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:12:16,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:16,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:16,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1149807759, now seen corresponding path program 1 times [2023-11-06 22:12:16,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:16,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108742345] [2023-11-06 22:12:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:16,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:16,188 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-06 22:12:16,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:16,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108742345] [2023-11-06 22:12:16,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108742345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:16,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:16,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:12:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555486101] [2023-11-06 22:12:16,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:16,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:12:16,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:16,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:12:16,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:12:16,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 388 [2023-11-06 22:12:16,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 122 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-06 22:12:16,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:16,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 388 [2023-11-06 22:12:16,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:17,123 INFO L124 PetriNetUnfolderBase]: 4847/7520 cut-off events. [2023-11-06 22:12:17,124 INFO L125 PetriNetUnfolderBase]: For 1460/1460 co-relation queries the response was YES. [2023-11-06 22:12:17,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15263 conditions, 7520 events. 4847/7520 cut-off events. For 1460/1460 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 46960 event pairs, 4015 based on Foata normal form. 0/5676 useless extension candidates. Maximal degree in co-relation 15255. Up to 6503 conditions per place. [2023-11-06 22:12:17,175 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 29 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-11-06 22:12:17,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 176 flow [2023-11-06 22:12:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-11-06 22:12:17,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4115120274914089 [2023-11-06 22:12:17,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-11-06 22:12:17,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-11-06 22:12:17,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:17,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-11-06 22:12:17,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 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-06 22:12:17,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06 22:12:17,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06 22:12:17,188 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 122 flow. Second operand 3 states and 479 transitions. [2023-11-06 22:12:17,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 176 flow [2023-11-06 22:12:17,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:12:17,193 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 114 flow [2023-11-06 22:12:17,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-11-06 22:12:17,194 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-11-06 22:12:17,194 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 114 flow [2023-11-06 22:12:17,195 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-06 22:12:17,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:17,195 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:17,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:12:17,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:17,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:17,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1884435532, now seen corresponding path program 1 times [2023-11-06 22:12:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:17,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637115021] [2023-11-06 22:12:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:17,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:17,396 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-06 22:12:17,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:17,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637115021] [2023-11-06 22:12:17,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637115021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:17,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795582637] [2023-11-06 22:12:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:17,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:17,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:17,398 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:17,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:12:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:17,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:12:17,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:17,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:12:17,514 INFO L351 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-06 22:12:17,605 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-06 22:12:17,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:12:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795582637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:17,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:12:17,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-11-06 22:12:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262816389] [2023-11-06 22:12:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:17,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:12:17,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:17,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:12:17,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:12:17,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 388 [2023-11-06 22:12:17,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 114 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-06 22:12:17,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:17,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 388 [2023-11-06 22:12:17,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:18,666 INFO L124 PetriNetUnfolderBase]: 8227/12486 cut-off events. [2023-11-06 22:12:18,666 INFO L125 PetriNetUnfolderBase]: For 1576/1576 co-relation queries the response was YES. [2023-11-06 22:12:18,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24992 conditions, 12486 events. 8227/12486 cut-off events. For 1576/1576 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 82169 event pairs, 4015 based on Foata normal form. 0/9415 useless extension candidates. Maximal degree in co-relation 24984. Up to 6737 conditions per place. [2023-11-06 22:12:18,751 INFO L140 encePairwiseOnDemand]: 383/388 looper letters, 51 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-11-06 22:12:18,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 289 flow [2023-11-06 22:12:18,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:12:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:12:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2023-11-06 22:12:18,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4368556701030928 [2023-11-06 22:12:18,755 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 678 transitions. [2023-11-06 22:12:18,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 678 transitions. [2023-11-06 22:12:18,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:18,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 678 transitions. [2023-11-06 22:12:18,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.5) internal successors, (678), 4 states have internal predecessors, (678), 0 states have call successors, (0), 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-06 22:12:18,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 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-06 22:12:18,762 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 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-06 22:12:18,762 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 114 flow. Second operand 4 states and 678 transitions. [2023-11-06 22:12:18,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 289 flow [2023-11-06 22:12:18,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:18,766 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 134 flow [2023-11-06 22:12:18,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-11-06 22:12:18,767 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2023-11-06 22:12:18,767 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 134 flow [2023-11-06 22:12:18,767 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-06 22:12:18,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:18,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:18,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:18,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:18,974 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:18,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1177026118, now seen corresponding path program 1 times [2023-11-06 22:12:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:18,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891120730] [2023-11-06 22:12:18,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:18,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:19,006 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-06 22:12:19,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:19,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891120730] [2023-11-06 22:12:19,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891120730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:12:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778163337] [2023-11-06 22:12:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:19,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:12:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:19,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:12:19,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:19,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 388 [2023-11-06 22:12:19,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 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-06 22:12:19,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:19,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 388 [2023-11-06 22:12:19,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:21,204 INFO L124 PetriNetUnfolderBase]: 17862/25376 cut-off events. [2023-11-06 22:12:21,204 INFO L125 PetriNetUnfolderBase]: For 4599/4599 co-relation queries the response was YES. [2023-11-06 22:12:21,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56101 conditions, 25376 events. 17862/25376 cut-off events. For 4599/4599 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 164254 event pairs, 8327 based on Foata normal form. 564/21585 useless extension candidates. Maximal degree in co-relation 56092. Up to 16659 conditions per place. [2023-11-06 22:12:21,590 INFO L140 encePairwiseOnDemand]: 380/388 looper letters, 58 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2023-11-06 22:12:21,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 357 flow [2023-11-06 22:12:21,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2023-11-06 22:12:21,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4415807560137457 [2023-11-06 22:12:21,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2023-11-06 22:12:21,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2023-11-06 22:12:21,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:21,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2023-11-06 22:12:21,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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-06 22:12:21,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06 22:12:21,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06 22:12:21,617 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 134 flow. Second operand 3 states and 514 transitions. [2023-11-06 22:12:21,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 357 flow [2023-11-06 22:12:21,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:12:21,623 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 193 flow [2023-11-06 22:12:21,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-11-06 22:12:21,624 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2023-11-06 22:12:21,624 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 193 flow [2023-11-06 22:12:21,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 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-06 22:12:21,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:21,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:21,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:12:21,625 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:21,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:21,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2128074232, now seen corresponding path program 1 times [2023-11-06 22:12:21,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:21,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754976571] [2023-11-06 22:12:21,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:21,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,896 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-06 22:12:21,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:21,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754976571] [2023-11-06 22:12:21,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754976571] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:21,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812883315] [2023-11-06 22:12:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:21,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:21,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:21,901 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:21,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:12:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:21,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:12:21,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:22,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:12:22,012 INFO L351 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-06 22:12:22,182 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-06 22:12:22,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:22,288 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-06 22:12:22,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812883315] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:22,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:22,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-11-06 22:12:22,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024786213] [2023-11-06 22:12:22,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:22,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:12:22,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:22,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:12:22,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:12:22,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 388 [2023-11-06 22:12:22,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 193 flow. Second operand has 12 states, 12 states have (on average 150.25) internal successors, (1803), 12 states have internal predecessors, (1803), 0 states have call successors, (0), 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-06 22:12:22,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:22,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 388 [2023-11-06 22:12:22,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:25,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, 20#L713true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:25,294 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:12:25,294 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:25,294 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:25,295 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:25,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, 29#L705-6true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:25,453 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:12:25,453 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:25,453 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:25,453 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:12:25,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:25,454 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:12:25,454 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:25,454 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:25,454 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:25,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:25,562 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:12:25,563 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:25,563 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:25,563 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:25,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 13#thr1EXITtrue]) [2023-11-06 22:12:25,563 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:12:25,563 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:25,563 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:25,564 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:25,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [154#L706-1true, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:25,564 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:12:25,564 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:25,564 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:25,564 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:25,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 20#L713true, 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:25,625 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 22:12:25,625 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:25,625 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:25,625 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:25,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:25,662 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 22:12:25,662 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:25,662 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:25,662 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:25,724 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 29#L705-6true, 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:25,724 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 22:12:25,725 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:12:25,725 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:25,725 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:25,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 315#(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|)), 180#true]) [2023-11-06 22:12:25,726 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 22:12:25,726 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:25,726 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:25,726 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:25,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:25,835 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 22:12:25,835 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:25,835 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:25,836 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:25,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 13#thr1EXITtrue]) [2023-11-06 22:12:25,836 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 22:12:25,837 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:25,837 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:25,837 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:25,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 154#L706-1true, 240#true, 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:25,838 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 22:12:25,838 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:25,838 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:25,838 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:25,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 20#L713true, 240#true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:25,863 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 22:12:25,863 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:25,864 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:25,864 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:25,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][34], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, 197#(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)), thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:25,903 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 22:12:25,903 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:25,903 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:25,903 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:25,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, 29#L705-6true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:25,919 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 22:12:25,919 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:25,919 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:25,919 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:25,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:25,920 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 22:12:25,920 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:25,920 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:25,920 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:25,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 20#L713true, 33#L725-5true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:25,960 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 22:12:25,960 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:25,960 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:25,960 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:25,961 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:25,961 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 22:12:25,961 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:25,961 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:25,961 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:25,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 13#thr1EXITtrue]) [2023-11-06 22:12:25,962 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 22:12:25,962 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:25,962 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:25,962 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:25,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [154#L706-1true, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:25,963 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 22:12:25,963 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:25,963 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:25,963 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:26,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 20#L713true, Black: 197#(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)), 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,213 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-06 22:12:26,213 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:26,213 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:26,213 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:26,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 33#L725-5true, 29#L705-6true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,222 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-06 22:12:26,222 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:26,222 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:26,222 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:26,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 33#L725-5true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,223 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-06 22:12:26,223 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:26,223 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:26,223 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:26,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 240#true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,224 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-06 22:12:26,224 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:26,224 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:26,225 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:26,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 29#L705-6true, Black: 197#(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)), 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,247 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 22:12:26,247 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:26,247 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,248 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:26,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,248 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 22:12:26,248 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:26,248 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,249 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:26,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 33#L725-5true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,256 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 22:12:26,257 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:26,257 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:26,257 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 33#L725-5true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 13#thr1EXITtrue, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,257 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 22:12:26,257 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:26,258 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:26,258 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [154#L706-1true, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 33#L725-5true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,259 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 22:12:26,259 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:26,259 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,259 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:26,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 20#L713true, 240#true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 131#L725-4true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,280 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 22:12:26,280 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,281 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,281 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,282 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:26,282 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 22:12:26,282 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,282 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,282 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:26,283 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 13#thr1EXITtrue]) [2023-11-06 22:12:26,284 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 22:12:26,284 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,284 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,284 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:26,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 154#L706-1true, 240#true, Black: 197#(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)), 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,285 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 22:12:26,286 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,286 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:26,286 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 319#(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|)), 240#true, 20#L713true, 33#L725-5true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,291 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 22:12:26,291 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,291 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,292 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,293 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 33#L725-5true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,294 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 22:12:26,294 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,294 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,294 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:26,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 29#L705-6true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 131#L725-4true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,309 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 22:12:26,309 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:26,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,310 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:12:26,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 131#L725-4true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,310 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 22:12:26,311 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,311 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:12:26,311 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][75], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 131#L725-4true, 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,312 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 22:12:26,312 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:12:26,312 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:26,313 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,315 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 319#(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|)), 240#true, 33#L725-5true, 29#L705-6true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,315 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 22:12:26,315 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:26,316 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,316 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:12:26,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 319#(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|)), 240#true, 33#L725-5true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,317 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 22:12:26,317 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:12:26,317 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,317 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,328 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 131#L725-4true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,328 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 22:12:26,328 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:26,329 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:12:26,329 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:12:26,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 131#L725-4true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 13#thr1EXITtrue, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,330 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 22:12:26,330 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:12:26,330 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:26,330 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:12:26,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [154#L706-1true, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 131#L725-4true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,331 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 22:12:26,331 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:26,332 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:12:26,332 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:12:26,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [319#(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|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 33#L725-5true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:26,333 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 22:12:26,333 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:12:26,334 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:12:26,334 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:26,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 319#(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|)), 240#true, 33#L725-5true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 13#thr1EXITtrue]) [2023-11-06 22:12:26,335 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 22:12:26,335 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:26,335 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:12:26,336 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:12:26,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [319#(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|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 154#L706-1true, 240#true, 33#L725-5true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,337 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 22:12:26,337 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 22:12:26,337 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:12:26,337 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:26,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [319#(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|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 20#L713true, 240#true, Black: 197#(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)), 102#L713true, 131#L725-4true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,342 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-06 22:12:26,342 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:12:26,343 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 22:12:26,343 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:12:26,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][35], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 79#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 102#L713true, 131#L725-4true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|))]) [2023-11-06 22:12:26,345 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-06 22:12:26,345 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:26,345 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:12:26,345 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 22:12:26,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [319#(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|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 33#L725-5true, Black: 197#(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)), 102#L713true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,346 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-06 22:12:26,347 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:26,347 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 22:12:26,347 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 22:12:26,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [319#(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|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, 29#L705-6true, Black: 197#(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)), 102#L713true, 131#L725-4true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,350 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-06 22:12:26,350 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 22:12:26,350 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:12:26,351 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:26,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 319#(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|)), 240#true, Black: 197#(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)), 102#L713true, 131#L725-4true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,352 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-06 22:12:26,352 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 22:12:26,352 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 22:12:26,352 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:12:26,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [319#(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|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 102#L713true, 131#L725-4true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:26,354 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-06 22:12:26,355 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,355 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:12:26,355 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:12:26,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [319#(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|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 102#L713true, 131#L725-4true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 13#thr1EXITtrue]) [2023-11-06 22:12:26,356 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-06 22:12:26,356 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,356 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:12:26,357 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:12:26,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 319#(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|)), 154#L706-1true, 240#true, Black: 197#(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)), 102#L713true, 131#L725-4true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,360 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-06 22:12:26,360 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:12:26,360 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:12:26,360 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:26,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][107], [319#(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|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 240#true, Black: 197#(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)), 102#L713true, 131#L725-4true, 133#L713true, 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:26,361 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-06 22:12:26,362 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:12:26,362 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 22:12:26,362 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:26,362 INFO L124 PetriNetUnfolderBase]: 21476/30899 cut-off events. [2023-11-06 22:12:26,363 INFO L125 PetriNetUnfolderBase]: For 17041/17580 co-relation queries the response was YES. [2023-11-06 22:12:26,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77550 conditions, 30899 events. 21476/30899 cut-off events. For 17041/17580 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 203719 event pairs, 4439 based on Foata normal form. 520/27312 useless extension candidates. Maximal degree in co-relation 77540. Up to 7907 conditions per place. [2023-11-06 22:12:26,736 INFO L140 encePairwiseOnDemand]: 382/388 looper letters, 100 selfloop transitions, 12 changer transitions 0/126 dead transitions. [2023-11-06 22:12:26,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 126 transitions, 667 flow [2023-11-06 22:12:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:12:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:12:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 986 transitions. [2023-11-06 22:12:26,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42353951890034364 [2023-11-06 22:12:26,747 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 986 transitions. [2023-11-06 22:12:26,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 986 transitions. [2023-11-06 22:12:26,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:26,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 986 transitions. [2023-11-06 22:12:26,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.33333333333334) internal successors, (986), 6 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:26,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 388.0) internal successors, (2716), 7 states have internal predecessors, (2716), 0 states have call successors, (0), 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-06 22:12:26,761 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 388.0) internal successors, (2716), 7 states have internal predecessors, (2716), 0 states have call successors, (0), 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-06 22:12:26,761 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 193 flow. Second operand 6 states and 986 transitions. [2023-11-06 22:12:26,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 126 transitions, 667 flow [2023-11-06 22:12:26,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 126 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:12:26,832 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 259 flow [2023-11-06 22:12:26,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2023-11-06 22:12:26,833 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2023-11-06 22:12:26,833 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 259 flow [2023-11-06 22:12:26,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 150.25) internal successors, (1803), 12 states have internal predecessors, (1803), 0 states have call successors, (0), 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-06 22:12:26,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:26,834 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:26,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:27,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 22:12:27,043 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:27,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:27,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2105232335, now seen corresponding path program 1 times [2023-11-06 22:12:27,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:27,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488069258] [2023-11-06 22:12:27,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:27,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:27,232 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-06 22:12:27,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:27,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488069258] [2023-11-06 22:12:27,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488069258] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460827971] [2023-11-06 22:12:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:27,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:27,235 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:27,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:12:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:27,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:12:27,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:27,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:12:27,354 INFO L351 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-06 22:12:27,482 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-06 22:12:27,482 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:12:27,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460827971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:27,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:12:27,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-11-06 22:12:27,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773781520] [2023-11-06 22:12:27,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:27,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:12:27,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:27,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:12:27,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:12:27,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 388 [2023-11-06 22:12:27,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 259 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-06 22:12:27,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:27,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 388 [2023-11-06 22:12:27,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:29,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 20#L713true, 102#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:29,914 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-06 22:12:29,914 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:29,915 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:29,915 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:30,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 20#L713true, 33#L725-5true, 102#L713true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,201 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 22:12:30,201 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:30,201 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:30,202 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:30,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 29#L705-6true, 102#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,208 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 22:12:30,209 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:30,209 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:30,209 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:30,209 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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|)), 113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 102#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,209 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 22:12:30,210 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:30,210 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:30,210 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:30,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 20#L713true, Black: 197#(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)), 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:30,460 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,460 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:30,460 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:30,460 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 29#L705-6true, 102#L713true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,469 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,469 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:30,469 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:30,469 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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|)), 113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 102#L713true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,470 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,471 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:30,471 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,471 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:30,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 102#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:30,479 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,479 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:30,479 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:30,479 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 102#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 13#thr1EXITtrue]) [2023-11-06 22:12:30,480 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,481 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:30,481 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,481 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:12:30,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 154#L706-1true, 33#L725-5true, 102#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,482 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,482 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:30,482 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:30,482 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 20#L713true, 102#L713true, 131#L725-4true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,631 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,631 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,632 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,632 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 29#L705-6true, Black: 197#(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)), 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:30,854 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,854 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,855 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:30,855 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, Black: 197#(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)), 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:30,855 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,855 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,855 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:30,855 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 102#L713true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:30,860 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,860 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,860 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,860 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:30,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 102#L713true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 13#thr1EXITtrue]) [2023-11-06 22:12:30,861 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,861 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:30,861 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:30,861 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 154#L706-1true, 33#L725-5true, 102#L713true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,862 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,862 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,862 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,862 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:30,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 102#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,865 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,865 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,865 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:30,865 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:30,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 20#L713true, 102#L713true, 131#L725-4true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,949 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:12:30,949 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,949 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,949 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:30,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 29#L705-6true, 131#L725-4true, 102#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,954 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:12:30,954 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:30,954 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:30,954 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:30,955 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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|)), 113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 102#L713true, 131#L725-4true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:30,955 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:12:30,955 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:30,955 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:30,955 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:31,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, Black: 197#(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)), 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:31,039 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:12:31,039 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:31,039 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:31,039 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, Black: 197#(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)), 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 13#thr1EXITtrue]) [2023-11-06 22:12:31,040 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:12:31,040 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:31,040 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:31,040 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 154#L706-1true, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, Black: 197#(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)), 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:31,041 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:12:31,041 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:31,041 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,041 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:31,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, 102#L713true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:31,043 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:12:31,043 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:31,043 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,043 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:31,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 20#L713true, Black: 197#(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)), 131#L725-4true, 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:31,129 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 22:12:31,129 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:31,129 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:31,129 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:31,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 29#L705-6true, 102#L713true, 131#L725-4true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:31,134 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 22:12:31,134 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,134 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,134 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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|)), 113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 131#L725-4true, 102#L713true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:31,135 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 22:12:31,135 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:31,135 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:12:31,135 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:31,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 102#L713true, 131#L725-4true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:31,140 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 22:12:31,140 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,140 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,140 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 102#L713true, 131#L725-4true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 13#thr1EXITtrue]) [2023-11-06 22:12:31,140 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 22:12:31,141 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:12:31,141 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,141 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 154#L706-1true, 102#L713true, 131#L725-4true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:31,142 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 22:12:31,142 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,142 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,142 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 33#L725-5true, Black: 197#(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)), 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:31,344 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-06 22:12:31,344 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,344 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,344 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:31,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 29#L705-6true, Black: 197#(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)), 131#L725-4true, 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:31,433 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 22:12:31,433 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,433 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,433 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [113#thr1Err2ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 197#(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)), 102#L713true, 131#L725-4true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:31,434 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 22:12:31,434 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 22:12:31,434 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:31,434 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:12:31,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 131#L725-4true, 102#L713true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:31,438 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 22:12:31,438 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,438 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,438 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 102#L713true, 131#L725-4true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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|)), 13#thr1EXITtrue]) [2023-11-06 22:12:31,438 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 22:12:31,439 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:31,439 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,439 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 154#L706-1true, 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 102#L713true, 131#L725-4true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:31,439 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 22:12:31,440 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,440 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,440 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 131#L725-4true, 102#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, 34#L709-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:31,442 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 22:12:31,443 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,443 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:12:31,443 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 197#(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)), 131#L725-4true, 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 76#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue]) [2023-11-06 22:12:31,589 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 22:12:31,589 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:31,589 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,589 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 197#(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)), 131#L725-4true, 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 13#thr1EXITtrue]) [2023-11-06 22:12:31,590 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 22:12:31,590 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:31,590 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:31,590 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 154#L706-1true, Black: 197#(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)), 102#L713true, 131#L725-4true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:31,591 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 22:12:31,591 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:31,592 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,592 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 317#(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: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), 131#L725-4true, 102#L713true, 133#L713true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), 197#(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)), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true, 315#(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-06 22:12:31,594 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 22:12:31,594 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,594 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:12:31,594 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:31,853 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] L709-1-->L713: Formula: (and (not (= (ite (= v_~m~0_35 1) 1 0) 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_13|, ~m~0=v_~m~0_34, 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][25], [Black: 313#(and (= (select |#length| 3) 24) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|)), 205#(and (or (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= 3 |~#storage~0.base|)) (= (select |#valid| |~#storage~0.base|) 1)), 189#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|))), Black: 197#(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)), 131#L725-4true, 102#L713true, 53#L705-6true, 331#(and (= |~#storage~0.offset| 0) (= 3 |~#storage~0.base|) (<= 24 (select |#length| 3))), 237#(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))), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 51#L707-1true, thr1Thread3of3ForFork0InUse, 317#(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|)), 185#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 242#(< |thr1Thread1of3ForFork0_findMax_~e~0#1| (+ ~max~0 1)), 180#true]) [2023-11-06 22:12:31,853 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 22:12:31,853 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:12:31,853 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:31,854 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:12:32,590 INFO L124 PetriNetUnfolderBase]: 30586/44566 cut-off events. [2023-11-06 22:12:32,591 INFO L125 PetriNetUnfolderBase]: For 50024/50192 co-relation queries the response was YES. [2023-11-06 22:12:32,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113539 conditions, 44566 events. 30586/44566 cut-off events. For 50024/50192 co-relation queries the response was YES. Maximal size of possible extension queue 1498. Compared 312771 event pairs, 13540 based on Foata normal form. 2/37827 useless extension candidates. Maximal degree in co-relation 113527. Up to 25543 conditions per place. [2023-11-06 22:12:32,971 INFO L140 encePairwiseOnDemand]: 383/388 looper letters, 74 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2023-11-06 22:12:32,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 600 flow [2023-11-06 22:12:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:12:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:12:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2023-11-06 22:12:32,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43621134020618557 [2023-11-06 22:12:32,975 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 677 transitions. [2023-11-06 22:12:32,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 677 transitions. [2023-11-06 22:12:32,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:32,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 677 transitions. [2023-11-06 22:12:32,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 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-06 22:12:32,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 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-06 22:12:32,984 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 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-06 22:12:32,984 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 259 flow. Second operand 4 states and 677 transitions. [2023-11-06 22:12:32,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 600 flow [2023-11-06 22:12:33,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 569 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-11-06 22:12:33,006 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 264 flow [2023-11-06 22:12:33,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=264, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2023-11-06 22:12:33,007 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2023-11-06 22:12:33,007 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 264 flow [2023-11-06 22:12:33,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-06 22:12:33,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:33,008 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:33,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:33,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-06 22:12:33,216 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:33,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:33,217 INFO L85 PathProgramCache]: Analyzing trace with hash 697556494, now seen corresponding path program 1 times [2023-11-06 22:12:33,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:33,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522646188] [2023-11-06 22:12:33,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:33,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:33,251 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-06 22:12:33,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:33,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522646188] [2023-11-06 22:12:33,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522646188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:33,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:33,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:12:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112279962] [2023-11-06 22:12:33,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:33,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:12:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:33,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:12:33,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:33,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 388 [2023-11-06 22:12:33,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 264 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-06 22:12:33,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:33,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 388 [2023-11-06 22:12:33,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:42,018 INFO L124 PetriNetUnfolderBase]: 59765/82166 cut-off events. [2023-11-06 22:12:42,018 INFO L125 PetriNetUnfolderBase]: For 69290/69354 co-relation queries the response was YES. [2023-11-06 22:12:42,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220955 conditions, 82166 events. 59765/82166 cut-off events. For 69290/69354 co-relation queries the response was YES. Maximal size of possible extension queue 2587. Compared 557817 event pairs, 24821 based on Foata normal form. 1812/77942 useless extension candidates. Maximal degree in co-relation 220942. Up to 51648 conditions per place. [2023-11-06 22:12:42,544 INFO L140 encePairwiseOnDemand]: 380/388 looper letters, 82 selfloop transitions, 10 changer transitions 0/99 dead transitions. [2023-11-06 22:12:42,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 99 transitions, 650 flow [2023-11-06 22:12:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2023-11-06 22:12:42,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4415807560137457 [2023-11-06 22:12:42,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2023-11-06 22:12:42,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2023-11-06 22:12:42,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:42,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2023-11-06 22:12:42,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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-06 22:12:42,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06 22:12:42,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 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-06 22:12:42,553 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 264 flow. Second operand 3 states and 514 transitions. [2023-11-06 22:12:42,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 99 transitions, 650 flow [2023-11-06 22:12:42,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 99 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:12:42,675 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 341 flow [2023-11-06 22:12:42,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-11-06 22:12:42,676 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2023-11-06 22:12:42,676 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 341 flow [2023-11-06 22:12:42,677 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-06 22:12:42,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:42,677 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:42,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:12:42,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:42,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash 149417723, now seen corresponding path program 1 times [2023-11-06 22:12:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:42,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935132344] [2023-11-06 22:12:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:42,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:42,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935132344] [2023-11-06 22:12:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935132344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:42,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650594948] [2023-11-06 22:12:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:42,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:42,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:42,947 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:42,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:12:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:43,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:12:43,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:43,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:12:43,066 INFO L351 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-06 22:12:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:43,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:43,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:43,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650594948] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:43,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:43,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-11-06 22:12:43,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681846271] [2023-11-06 22:12:43,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:43,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:12:43,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:43,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:12:43,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:12:43,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 388 [2023-11-06 22:12:43,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 341 flow. Second operand has 12 states, 12 states have (on average 153.5) internal successors, (1842), 12 states have internal predecessors, (1842), 0 states have call successors, (0), 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-06 22:12:43,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:43,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 388 [2023-11-06 22:12:43,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:55,799 INFO L124 PetriNetUnfolderBase]: 69909/100121 cut-off events. [2023-11-06 22:12:55,799 INFO L125 PetriNetUnfolderBase]: For 115250/117108 co-relation queries the response was YES. [2023-11-06 22:12:56,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292209 conditions, 100121 events. 69909/100121 cut-off events. For 115250/117108 co-relation queries the response was YES. Maximal size of possible extension queue 3081. Compared 748527 event pairs, 14060 based on Foata normal form. 2422/98840 useless extension candidates. Maximal degree in co-relation 292195. Up to 26980 conditions per place. [2023-11-06 22:12:56,529 INFO L140 encePairwiseOnDemand]: 382/388 looper letters, 142 selfloop transitions, 11 changer transitions 0/170 dead transitions. [2023-11-06 22:12:56,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 170 transitions, 1196 flow [2023-11-06 22:12:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:12:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:12:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1002 transitions. [2023-11-06 22:12:56,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43041237113402064 [2023-11-06 22:12:56,534 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1002 transitions. [2023-11-06 22:12:56,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1002 transitions. [2023-11-06 22:12:56,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:56,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1002 transitions. [2023-11-06 22:12:56,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 167.0) internal successors, (1002), 6 states have internal predecessors, (1002), 0 states have call successors, (0), 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-06 22:12:56,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 388.0) internal successors, (2716), 7 states have internal predecessors, (2716), 0 states have call successors, (0), 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-06 22:12:56,542 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 388.0) internal successors, (2716), 7 states have internal predecessors, (2716), 0 states have call successors, (0), 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-06 22:12:56,543 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 341 flow. Second operand 6 states and 1002 transitions. [2023-11-06 22:12:56,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 170 transitions, 1196 flow [2023-11-06 22:12:57,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 170 transitions, 1170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:12:57,369 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 388 flow [2023-11-06 22:12:57,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=388, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2023-11-06 22:12:57,370 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2023-11-06 22:12:57,370 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 388 flow [2023-11-06 22:12:57,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 153.5) internal successors, (1842), 12 states have internal predecessors, (1842), 0 states have call successors, (0), 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-06 22:12:57,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:57,371 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-06 22:12:57,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-06 22:12:57,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c820b06f-db6a-4dcb-9d4e-145adcd0fd35/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-06 22:12:57,577 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2023-11-06 22:12:57,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash 186702483, now seen corresponding path program 1 times [2023-11-06 22:12:57,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:57,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726596855] [2023-11-06 22:12:57,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:57,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:12:57,590 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:12:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:12:57,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:12:57,603 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:12:57,604 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2023-11-06 22:12:57,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2023-11-06 22:12:57,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:12:57,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2023-11-06 22:12:57,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:12:57,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:12:57,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2023-11-06 22:12:57,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:12:57,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:12:57,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2023-11-06 22:12:57,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2023-11-06 22:12:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2023-11-06 22:12:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2023-11-06 22:12:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2023-11-06 22:12:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2023-11-06 22:12:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:12:57,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 22:12:57,607 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:57,608 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:12:57,608 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-06 22:12:57,641 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:12:57,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 239 transitions, 506 flow [2023-11-06 22:12:57,687 INFO L124 PetriNetUnfolderBase]: 29/309 cut-off events. [2023-11-06 22:12:57,688 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 22:12:57,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 309 events. 29/309 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1034 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 249. Up to 10 conditions per place. [2023-11-06 22:12:57,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 239 transitions, 506 flow [2023-11-06 22:12:57,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 239 transitions, 506 flow [2023-11-06 22:12:57,695 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:12:57,695 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 239 transitions, 506 flow [2023-11-06 22:12:57,696 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 239 transitions, 506 flow [2023-11-06 22:12:57,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 239 transitions, 506 flow [2023-11-06 22:12:57,738 INFO L124 PetriNetUnfolderBase]: 29/309 cut-off events. [2023-11-06 22:12:57,738 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 22:12:57,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 309 events. 29/309 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1034 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 249. Up to 10 conditions per place. [2023-11-06 22:12:57,762 INFO L119 LiptonReduction]: Number of co-enabled transitions 36848