./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/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_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 422a1b4addf42b15afc18c6b3ff87ab94cf45a5af46627fa0165a3dbe9c138e8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:11:42,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:11:43,009 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:11:43,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:11:43,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:11:43,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:11:43,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:11:43,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:11:43,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:11:43,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:11:43,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:11:43,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:11:43,042 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:11:43,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:11:43,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:11:43,044 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:11:43,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:11:43,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:11:43,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:11:43,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:11:43,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:11:43,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:11:43,048 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:11:43,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:11:43,049 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:11:43,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:11:43,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:11:43,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:11:43,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:11:43,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:11:43,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:11:43,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:11:43,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:11:43,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:11:43,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:11:43,055 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:11:43,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:11:43,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:11:43,056 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:11:43,057 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_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/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_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 422a1b4addf42b15afc18c6b3ff87ab94cf45a5af46627fa0165a3dbe9c138e8 [2023-11-06 22:11:43,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:11:43,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:11:43,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:11:43,392 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:11:43,394 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:11:43,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2023-11-06 22:11:46,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:11:46,874 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:11:46,874 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2023-11-06 22:11:46,883 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/data/a5cff98d2/f5e520c3a76c45b9be9bc492a3ea6c9e/FLAG2bf7e1764 [2023-11-06 22:11:46,902 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/data/a5cff98d2/f5e520c3a76c45b9be9bc492a3ea6c9e [2023-11-06 22:11:46,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:11:46,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:11:46,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:11:46,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:11:46,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:11:46,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f25d4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:46, skipping insertion in model container [2023-11-06 22:11:46,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:11:46" (1/1) ... [2023-11-06 22:11:46,964 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:11:47,140 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c[4218,4231] [2023-11-06 22:11:47,151 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:11:47,162 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:11:47,208 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c[4218,4231] [2023-11-06 22:11:47,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:11:47,248 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:11:47,257 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:11:47,267 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:11:47,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:47 WrapperNode [2023-11-06 22:11:47,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:11:47,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:11:47,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:11:47,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:11:47,277 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:47" (1/1) ... [2023-11-06 22:11:47,287 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:47" (1/1) ... [2023-11-06 22:11:47,319 INFO L138 Inliner]: procedures = 27, calls = 80, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 316 [2023-11-06 22:11:47,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:11:47,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:11:47,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:11:47,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:11:47,329 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:47" (1/1) ... [2023-11-06 22:11:47,330 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:47" (1/1) ... [2023-11-06 22:11:47,336 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:47" (1/1) ... [2023-11-06 22:11:47,336 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:47" (1/1) ... [2023-11-06 22:11:47,348 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:47" (1/1) ... [2023-11-06 22:11:47,353 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:47" (1/1) ... [2023-11-06 22:11:47,356 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:47" (1/1) ... [2023-11-06 22:11:47,359 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:47" (1/1) ... [2023-11-06 22:11:47,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:11:47,388 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:11:47,389 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:11:47,389 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:11:47,390 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:47" (1/1) ... [2023-11-06 22:11:47,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:11:47,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:11:47,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/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:47,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/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:47,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:11:47,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:11:47,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:11:47,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:11:47,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 22:11:47,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 22:11:47,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 22:11:47,477 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 22:11:47,477 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 22:11:47,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 22:11:47,478 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-06 22:11:47,478 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-06 22:11:47,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:11:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:11:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:11:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:11:47,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:11:47,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:11:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:11:47,482 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:47,639 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:11:47,641 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:11:48,184 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:11:48,407 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:11:48,407 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 22:11:48,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:11:48 BoogieIcfgContainer [2023-11-06 22:11:48,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:11:48,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:11:48,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:11:48,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:11:48,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:11:46" (1/3) ... [2023-11-06 22:11:48,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b712714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:11:48, skipping insertion in model container [2023-11-06 22:11:48,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:11:47" (2/3) ... [2023-11-06 22:11:48,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b712714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:11:48, skipping insertion in model container [2023-11-06 22:11:48,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:11:48" (3/3) ... [2023-11-06 22:11:48,429 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2023-11-06 22:11:48,438 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:11:48,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:11:48,459 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:11:48,459 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:11:48,591 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-06 22:11:48,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 237 transitions, 502 flow [2023-11-06 22:11:48,880 INFO L124 PetriNetUnfolderBase]: 18/233 cut-off events. [2023-11-06 22:11:48,880 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:11:48,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 233 events. 18/233 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 120 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 194. Up to 2 conditions per place. [2023-11-06 22:11:48,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 237 transitions, 502 flow [2023-11-06 22:11:48,904 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 220 transitions, 464 flow [2023-11-06 22:11:48,910 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:11:48,937 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 220 transitions, 464 flow [2023-11-06 22:11:48,942 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 220 transitions, 464 flow [2023-11-06 22:11:48,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 220 transitions, 464 flow [2023-11-06 22:11:49,036 INFO L124 PetriNetUnfolderBase]: 18/220 cut-off events. [2023-11-06 22:11:49,037 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:11:49,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 220 events. 18/220 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 117 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 194. Up to 2 conditions per place. [2023-11-06 22:11:49,043 INFO L119 LiptonReduction]: Number of co-enabled transitions 2000 [2023-11-06 22:12:01,968 INFO L134 LiptonReduction]: Checked pairs total: 4151 [2023-11-06 22:12:01,968 INFO L136 LiptonReduction]: Total number of compositions: 221 [2023-11-06 22:12:01,984 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:12:01,991 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1c80b21d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:12:01,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-06 22:12:02,000 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:12:02,001 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2023-11-06 22:12:02,001 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:12:02,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:02,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:02,002 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:02,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -935305242, now seen corresponding path program 1 times [2023-11-06 22:12:02,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:02,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870469041] [2023-11-06 22:12:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:02,638 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,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:02,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870469041] [2023-11-06 22:12:02,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870469041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:02,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:02,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:12:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057896633] [2023-11-06 22:12:02,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:02,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:12:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:02,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:12:02,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:02,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 458 [2023-11-06 22:12:02,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 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,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:02,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 458 [2023-11-06 22:12:02,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:03,458 INFO L124 PetriNetUnfolderBase]: 2606/3582 cut-off events. [2023-11-06 22:12:03,458 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2023-11-06 22:12:03,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7115 conditions, 3582 events. 2606/3582 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 16020 event pairs, 498 based on Foata normal form. 1/2315 useless extension candidates. Maximal degree in co-relation 5886. Up to 2275 conditions per place. [2023-11-06 22:12:03,505 INFO L140 encePairwiseOnDemand]: 454/458 looper letters, 47 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-11-06 22:12:03,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 255 flow [2023-11-06 22:12:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2023-11-06 22:12:03,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49417758369723436 [2023-11-06 22:12:03,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2023-11-06 22:12:03,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2023-11-06 22:12:03,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:03,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2023-11-06 22:12:03,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 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,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 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,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 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,568 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 98 flow. Second operand 3 states and 679 transitions. [2023-11-06 22:12:03,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 255 flow [2023-11-06 22:12:03,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 229 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-06 22:12:03,583 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 101 flow [2023-11-06 22:12:03,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2023-11-06 22:12:03,592 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2023-11-06 22:12:03,592 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 101 flow [2023-11-06 22:12:03,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 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,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:03,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:03,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:12:03,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:03,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1522048703, now seen corresponding path program 1 times [2023-11-06 22:12:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:03,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729977313] [2023-11-06 22:12:03,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:03,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:03,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:03,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729977313] [2023-11-06 22:12:03,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729977313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:03,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:03,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:12:03,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448667165] [2023-11-06 22:12:03,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:03,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:12:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:03,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:12:03,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:03,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 458 [2023-11-06 22:12:03,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:03,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 458 [2023-11-06 22:12:03,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:04,483 INFO L124 PetriNetUnfolderBase]: 2709/3665 cut-off events. [2023-11-06 22:12:04,484 INFO L125 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2023-11-06 22:12:04,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8144 conditions, 3665 events. 2709/3665 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 16578 event pairs, 624 based on Foata normal form. 112/3138 useless extension candidates. Maximal degree in co-relation 2693. Up to 2597 conditions per place. [2023-11-06 22:12:04,523 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 55 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-06 22:12:04,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 63 transitions, 277 flow [2023-11-06 22:12:04,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2023-11-06 22:12:04,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898107714701601 [2023-11-06 22:12:04,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 673 transitions. [2023-11-06 22:12:04,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 673 transitions. [2023-11-06 22:12:04,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:04,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 673 transitions. [2023-11-06 22:12:04,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 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,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 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,548 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 101 flow. Second operand 3 states and 673 transitions. [2023-11-06 22:12:04,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 63 transitions, 277 flow [2023-11-06 22:12:04,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:04,562 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 112 flow [2023-11-06 22:12:04,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2023-11-06 22:12:04,563 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-06 22:12:04,564 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 112 flow [2023-11-06 22:12:04,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:04,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:04,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:12:04,566 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:04,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1786798188, now seen corresponding path program 1 times [2023-11-06 22:12:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:04,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397408908] [2023-11-06 22:12:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:04,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:12:04,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:04,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397408908] [2023-11-06 22:12:04,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397408908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:04,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:04,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:12:04,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315265975] [2023-11-06 22:12:04,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:04,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:12:04,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:04,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:12:04,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:12:04,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 458 [2023-11-06 22:12:04,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:04,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 458 [2023-11-06 22:12:04,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:05,277 INFO L124 PetriNetUnfolderBase]: 2667/3762 cut-off events. [2023-11-06 22:12:05,277 INFO L125 PetriNetUnfolderBase]: For 1538/1538 co-relation queries the response was YES. [2023-11-06 22:12:05,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8733 conditions, 3762 events. 2667/3762 cut-off events. For 1538/1538 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 18260 event pairs, 655 based on Foata normal form. 106/3521 useless extension candidates. Maximal degree in co-relation 6349. Up to 2665 conditions per place. [2023-11-06 22:12:05,309 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 55 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-06 22:12:05,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 63 transitions, 293 flow [2023-11-06 22:12:05,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:12:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:12:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2023-11-06 22:12:05,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883551673944687 [2023-11-06 22:12:05,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 671 transitions. [2023-11-06 22:12:05,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 671 transitions. [2023-11-06 22:12:05,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:05,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 671 transitions. [2023-11-06 22:12:05,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 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,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 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,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 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,321 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 112 flow. Second operand 3 states and 671 transitions. [2023-11-06 22:12:05,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 63 transitions, 293 flow [2023-11-06 22:12:05,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:05,324 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 124 flow [2023-11-06 22:12:05,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2023-11-06 22:12:05,325 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2023-11-06 22:12:05,326 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 124 flow [2023-11-06 22:12:05,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:05,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:05,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:12:05,327 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:05,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash -88792386, now seen corresponding path program 1 times [2023-11-06 22:12:05,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:05,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886475209] [2023-11-06 22:12:05,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:12:05,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:05,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886475209] [2023-11-06 22:12:05,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886475209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:05,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:05,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:12:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522236773] [2023-11-06 22:12:05,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:05,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:12:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:05,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:12:05,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:12:05,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 458 [2023-11-06 22:12:05,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 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,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:05,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 458 [2023-11-06 22:12:05,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:06,296 INFO L124 PetriNetUnfolderBase]: 3189/4593 cut-off events. [2023-11-06 22:12:06,296 INFO L125 PetriNetUnfolderBase]: For 2513/2513 co-relation queries the response was YES. [2023-11-06 22:12:06,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11217 conditions, 4593 events. 3189/4593 cut-off events. For 2513/2513 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 24424 event pairs, 2374 based on Foata normal form. 96/4587 useless extension candidates. Maximal degree in co-relation 5010. Up to 3495 conditions per place. [2023-11-06 22:12:06,336 INFO L140 encePairwiseOnDemand]: 454/458 looper letters, 61 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-11-06 22:12:06,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 333 flow [2023-11-06 22:12:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:12:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:12:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 843 transitions. [2023-11-06 22:12:06,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4601528384279476 [2023-11-06 22:12:06,341 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 843 transitions. [2023-11-06 22:12:06,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 843 transitions. [2023-11-06 22:12:06,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:06,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 843 transitions. [2023-11-06 22:12:06,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 210.75) internal successors, (843), 4 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:12:06,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 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,351 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 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,352 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 124 flow. Second operand 4 states and 843 transitions. [2023-11-06 22:12:06,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 333 flow [2023-11-06 22:12:06,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:06,357 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 142 flow [2023-11-06 22:12:06,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-11-06 22:12:06,359 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-11-06 22:12:06,359 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 142 flow [2023-11-06 22:12:06,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 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,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:06,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:06,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:12:06,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:06,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash -414907853, now seen corresponding path program 1 times [2023-11-06 22:12:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126007661] [2023-11-06 22:12:06,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:06,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:12:06,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126007661] [2023-11-06 22:12:06,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126007661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:06,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:06,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:12:06,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166177071] [2023-11-06 22:12:06,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:06,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:12:06,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:06,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:12:06,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:12:06,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 458 [2023-11-06 22:12:06,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 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,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:06,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 458 [2023-11-06 22:12:06,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:07,540 INFO L124 PetriNetUnfolderBase]: 3929/5783 cut-off events. [2023-11-06 22:12:07,541 INFO L125 PetriNetUnfolderBase]: For 3181/3181 co-relation queries the response was YES. [2023-11-06 22:12:07,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13859 conditions, 5783 events. 3929/5783 cut-off events. For 3181/3181 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 33182 event pairs, 3012 based on Foata normal form. 166/5840 useless extension candidates. Maximal degree in co-relation 11234. Up to 4406 conditions per place. [2023-11-06 22:12:07,598 INFO L140 encePairwiseOnDemand]: 454/458 looper letters, 60 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2023-11-06 22:12:07,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 348 flow [2023-11-06 22:12:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:12:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:12:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 841 transitions. [2023-11-06 22:12:07,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45906113537117904 [2023-11-06 22:12:07,602 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 841 transitions. [2023-11-06 22:12:07,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 841 transitions. [2023-11-06 22:12:07,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:07,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 841 transitions. [2023-11-06 22:12:07,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 210.25) internal successors, (841), 4 states have internal predecessors, (841), 0 states have call successors, (0), 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:07,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 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:07,613 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 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:07,613 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 142 flow. Second operand 4 states and 841 transitions. [2023-11-06 22:12:07,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 348 flow [2023-11-06 22:12:07,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 344 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:07,616 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 161 flow [2023-11-06 22:12:07,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-11-06 22:12:07,617 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-11-06 22:12:07,618 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 161 flow [2023-11-06 22:12:07,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 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:07,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:07,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:07,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:12:07,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:07,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:07,620 INFO L85 PathProgramCache]: Analyzing trace with hash -863235532, now seen corresponding path program 1 times [2023-11-06 22:12:07,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:07,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910785288] [2023-11-06 22:12:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:07,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:08,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:08,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910785288] [2023-11-06 22:12:08,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910785288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:08,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:08,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:12:08,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728079499] [2023-11-06 22:12:08,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:08,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:12:08,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:08,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:12:08,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:12:08,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-11-06 22:12:08,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 205.83333333333334) internal successors, (1235), 6 states have internal predecessors, (1235), 0 states have call successors, (0), 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:08,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:08,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-11-06 22:12:08,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:10,091 INFO L124 PetriNetUnfolderBase]: 6847/9798 cut-off events. [2023-11-06 22:12:10,092 INFO L125 PetriNetUnfolderBase]: For 4012/4012 co-relation queries the response was YES. [2023-11-06 22:12:10,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23427 conditions, 9798 events. 6847/9798 cut-off events. For 4012/4012 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 58476 event pairs, 360 based on Foata normal form. 44/9804 useless extension candidates. Maximal degree in co-relation 18030. Up to 6308 conditions per place. [2023-11-06 22:12:10,179 INFO L140 encePairwiseOnDemand]: 451/458 looper letters, 83 selfloop transitions, 7 changer transitions 24/118 dead transitions. [2023-11-06 22:12:10,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 118 transitions, 602 flow [2023-11-06 22:12:10,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:12:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:12:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1309 transitions. [2023-11-06 22:12:10,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47634643377001457 [2023-11-06 22:12:10,185 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1309 transitions. [2023-11-06 22:12:10,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1309 transitions. [2023-11-06 22:12:10,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:10,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1309 transitions. [2023-11-06 22:12:10,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 218.16666666666666) internal successors, (1309), 6 states have internal predecessors, (1309), 0 states have call successors, (0), 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,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 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,199 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 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,199 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 161 flow. Second operand 6 states and 1309 transitions. [2023-11-06 22:12:10,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 118 transitions, 602 flow [2023-11-06 22:12:10,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 118 transitions, 597 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:10,206 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 203 flow [2023-11-06 22:12:10,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-11-06 22:12:10,209 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2023-11-06 22:12:10,209 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 203 flow [2023-11-06 22:12:10,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.83333333333334) internal successors, (1235), 6 states have internal predecessors, (1235), 0 states have call successors, (0), 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,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:10,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:10,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:12:10,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:10,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:10,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1274602863, now seen corresponding path program 1 times [2023-11-06 22:12:10,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:10,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321040342] [2023-11-06 22:12:10,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:10,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:12:10,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321040342] [2023-11-06 22:12:10,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321040342] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:10,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380309599] [2023-11-06 22:12:10,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:10,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:10,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:10,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:10,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:12:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:10,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:12:10,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:12:11,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:12:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:12:11,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380309599] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:12:11,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:12:11,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2023-11-06 22:12:11,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126582428] [2023-11-06 22:12:11,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:12:11,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:12:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:11,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:12:11,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:12:11,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 458 [2023-11-06 22:12:11,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 203 flow. Second operand has 12 states, 12 states have (on average 198.33333333333334) internal successors, (2380), 12 states have internal predecessors, (2380), 0 states have call successors, (0), 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:11,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:11,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 458 [2023-11-06 22:12:11,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:14,261 INFO L124 PetriNetUnfolderBase]: 10573/15019 cut-off events. [2023-11-06 22:12:14,262 INFO L125 PetriNetUnfolderBase]: For 11184/11188 co-relation queries the response was YES. [2023-11-06 22:12:14,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40551 conditions, 15019 events. 10573/15019 cut-off events. For 11184/11188 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 88794 event pairs, 2064 based on Foata normal form. 424/15239 useless extension candidates. Maximal degree in co-relation 32537. Up to 5595 conditions per place. [2023-11-06 22:12:14,386 INFO L140 encePairwiseOnDemand]: 449/458 looper letters, 158 selfloop transitions, 29 changer transitions 0/190 dead transitions. [2023-11-06 22:12:14,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 190 transitions, 1093 flow [2023-11-06 22:12:14,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:12:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:12:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2097 transitions. [2023-11-06 22:12:14,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45786026200873364 [2023-11-06 22:12:14,395 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2097 transitions. [2023-11-06 22:12:14,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2097 transitions. [2023-11-06 22:12:14,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:14,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2097 transitions. [2023-11-06 22:12:14,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 209.7) internal successors, (2097), 10 states have internal predecessors, (2097), 0 states have call successors, (0), 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,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 458.0) internal successors, (5038), 11 states have internal predecessors, (5038), 0 states have call successors, (0), 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,414 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 458.0) internal successors, (5038), 11 states have internal predecessors, (5038), 0 states have call successors, (0), 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,415 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 203 flow. Second operand 10 states and 2097 transitions. [2023-11-06 22:12:14,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 190 transitions, 1093 flow [2023-11-06 22:12:14,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 190 transitions, 1075 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:14,424 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 397 flow [2023-11-06 22:12:14,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=397, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2023-11-06 22:12:14,425 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2023-11-06 22:12:14,425 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 397 flow [2023-11-06 22:12:14,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 198.33333333333334) internal successors, (2380), 12 states have internal predecessors, (2380), 0 states have call successors, (0), 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,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:14,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:14,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:12:14,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:12:14,633 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:14,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1858523528, now seen corresponding path program 2 times [2023-11-06 22:12:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198342940] [2023-11-06 22:12:14,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:15,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198342940] [2023-11-06 22:12:15,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198342940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:15,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:15,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:12:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857196345] [2023-11-06 22:12:15,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:15,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:12:15,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:15,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:12:15,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:12:15,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 458 [2023-11-06 22:12:15,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 397 flow. Second operand has 7 states, 7 states have (on average 204.28571428571428) internal successors, (1430), 7 states have internal predecessors, (1430), 0 states have call successors, (0), 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:15,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:15,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 458 [2023-11-06 22:12:15,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:18,489 INFO L124 PetriNetUnfolderBase]: 13291/19253 cut-off events. [2023-11-06 22:12:18,489 INFO L125 PetriNetUnfolderBase]: For 23650/23696 co-relation queries the response was YES. [2023-11-06 22:12:18,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60451 conditions, 19253 events. 13291/19253 cut-off events. For 23650/23696 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 119704 event pairs, 1984 based on Foata normal form. 232/19447 useless extension candidates. Maximal degree in co-relation 50491. Up to 12636 conditions per place. [2023-11-06 22:12:18,653 INFO L140 encePairwiseOnDemand]: 451/458 looper letters, 141 selfloop transitions, 21 changer transitions 47/215 dead transitions. [2023-11-06 22:12:18,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 215 transitions, 1402 flow [2023-11-06 22:12:18,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:12:18,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:12:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1962 transitions. [2023-11-06 22:12:18,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4759825327510917 [2023-11-06 22:12:18,662 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1962 transitions. [2023-11-06 22:12:18,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1962 transitions. [2023-11-06 22:12:18,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:18,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1962 transitions. [2023-11-06 22:12:18,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 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,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 458.0) internal successors, (4580), 10 states have internal predecessors, (4580), 0 states have call successors, (0), 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,679 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 458.0) internal successors, (4580), 10 states have internal predecessors, (4580), 0 states have call successors, (0), 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,680 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 397 flow. Second operand 9 states and 1962 transitions. [2023-11-06 22:12:18,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 215 transitions, 1402 flow [2023-11-06 22:12:18,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 215 transitions, 1365 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:18,742 INFO L231 Difference]: Finished difference. Result has 84 places, 87 transitions, 548 flow [2023-11-06 22:12:18,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=548, PETRI_PLACES=84, PETRI_TRANSITIONS=87} [2023-11-06 22:12:18,745 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2023-11-06 22:12:18,746 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 87 transitions, 548 flow [2023-11-06 22:12:18,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 204.28571428571428) internal successors, (1430), 7 states have internal predecessors, (1430), 0 states have call successors, (0), 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,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:18,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:18,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:12:18,749 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:18,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:18,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1008782760, now seen corresponding path program 3 times [2023-11-06 22:12:18,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843294973] [2023-11-06 22:12:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:12:19,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:19,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843294973] [2023-11-06 22:12:19,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843294973] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:19,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303717704] [2023-11-06 22:12:19,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:12:19,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:19,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:19,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:19,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:12:19,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 22:12:19,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:12:19,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:12:19,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:19,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:12:19,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303717704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:19,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:12:19,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2023-11-06 22:12:19,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524773243] [2023-11-06 22:12:19,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:19,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:12:19,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:12:19,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:12:19,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 458 [2023-11-06 22:12:19,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 87 transitions, 548 flow. Second operand has 6 states, 6 states have (on average 204.83333333333334) internal successors, (1229), 6 states have internal predecessors, (1229), 0 states have call successors, (0), 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,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:19,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 458 [2023-11-06 22:12:19,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:22,729 INFO L124 PetriNetUnfolderBase]: 13730/20080 cut-off events. [2023-11-06 22:12:22,729 INFO L125 PetriNetUnfolderBase]: For 50025/50948 co-relation queries the response was YES. [2023-11-06 22:12:22,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72516 conditions, 20080 events. 13730/20080 cut-off events. For 50025/50948 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 133304 event pairs, 1938 based on Foata normal form. 1121/20734 useless extension candidates. Maximal degree in co-relation 63935. Up to 12925 conditions per place. [2023-11-06 22:12:22,945 INFO L140 encePairwiseOnDemand]: 449/458 looper letters, 179 selfloop transitions, 44 changer transitions 31/264 dead transitions. [2023-11-06 22:12:22,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 264 transitions, 2103 flow [2023-11-06 22:12:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:12:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:12:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1960 transitions. [2023-11-06 22:12:22,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4754973313925279 [2023-11-06 22:12:22,955 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1960 transitions. [2023-11-06 22:12:22,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1960 transitions. [2023-11-06 22:12:22,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:22,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1960 transitions. [2023-11-06 22:12:22,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 217.77777777777777) internal successors, (1960), 9 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:22,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 458.0) internal successors, (4580), 10 states have internal predecessors, (4580), 0 states have call successors, (0), 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,973 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 458.0) internal successors, (4580), 10 states have internal predecessors, (4580), 0 states have call successors, (0), 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,974 INFO L175 Difference]: Start difference. First operand has 84 places, 87 transitions, 548 flow. Second operand 9 states and 1960 transitions. [2023-11-06 22:12:22,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 264 transitions, 2103 flow [2023-11-06 22:12:23,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 264 transitions, 2058 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-06 22:12:23,144 INFO L231 Difference]: Finished difference. Result has 94 places, 116 transitions, 951 flow [2023-11-06 22:12:23,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=94, PETRI_TRANSITIONS=116} [2023-11-06 22:12:23,145 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2023-11-06 22:12:23,145 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 116 transitions, 951 flow [2023-11-06 22:12:23,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.83333333333334) internal successors, (1229), 6 states have internal predecessors, (1229), 0 states have call successors, (0), 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:23,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:23,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:23,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:23,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:23,369 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:23,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1715804448, now seen corresponding path program 4 times [2023-11-06 22:12:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:23,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039677024] [2023-11-06 22:12:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:24,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039677024] [2023-11-06 22:12:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039677024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:24,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:24,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:12:24,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811137097] [2023-11-06 22:12:24,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:24,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:12:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:24,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:12:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:12:24,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 458 [2023-11-06 22:12:24,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 116 transitions, 951 flow. Second operand has 7 states, 7 states have (on average 203.28571428571428) internal successors, (1423), 7 states have internal predecessors, (1423), 0 states have call successors, (0), 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:24,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:24,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 458 [2023-11-06 22:12:24,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:26,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([948] L56-->L62: Formula: (and (= v_~i~0_14 (+ v_~i~0_15 1)) (= (ite (= (ite (< v_~i~0_14 v_~N~0_18) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_15|)) InVars {~i~0=v_~i~0_15, ~N~0=v_~N~0_18} OutVars{~i~0=v_~i~0_14, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_5|, ~N~0=v_~N~0_18, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_15|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~cond~0#1][147], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 82#L145-4true, 68#L62true, 196#L101true, 264#true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 487#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 644#true, Black: 247#(<= ~q2_back~0 ~q2_front~0), 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 253#(<= ~n1~0 0)]) [2023-11-06 22:12:26,878 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:12:26,878 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:26,878 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:12:26,878 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:26,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([969] L101-->L98: Formula: (and (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| (+ (select (select |v_#memory_int_99| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_55))) v_~total~0_84)) (<= v_~total~0_83 2147483647) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_11| 256) 0)) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_56)) 1 0) 0)) (<= 0 (+ v_~total~0_83 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_83)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_56, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, ~total~0=v_~total~0_84} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_5|, ~total~0=v_~total~0_83, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_5|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_5|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_56, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][177], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 82#L145-4true, 264#true, 484#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 149#L98true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:26,879 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:12:26,879 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:26,879 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:12:26,879 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:26,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_15| 256) 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][123], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 124#thread3EXITtrue, Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 82#L145-4true, 68#L62true, 264#true, 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 644#true, Black: 247#(<= ~q2_back~0 ~q2_front~0), 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:26,880 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:12:26,880 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:12:26,880 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:26,880 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:12:26,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([969] L101-->L98: Formula: (and (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| (+ (select (select |v_#memory_int_99| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_55))) v_~total~0_84)) (<= v_~total~0_83 2147483647) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_11| 256) 0)) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_56)) 1 0) 0)) (<= 0 (+ v_~total~0_83 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_83)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_56, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, ~total~0=v_~total~0_84} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_5|, ~total~0=v_~total~0_83, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_5|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_5|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_56, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][176], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 491#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 82#L145-4true, 68#L62true, 264#true, 149#L98true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)))), Black: 253#(<= ~n1~0 0)]) [2023-11-06 22:12:26,881 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:12:26,881 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:12:26,881 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:26,881 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:12:26,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L62-->L56: Formula: (and (not (= (ite (= (select (select |v_#memory_int_83| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_back~0_53))) v_~C~0_30) 1 0) 0)) (not (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_13| 256) 0)) (= (+ 1 v_~q1_back~0_53) v_~q1_back~0_52) (not (= (ite (and (< v_~q1_back~0_53 v_~n1~0_22) (<= 0 v_~q1_back~0_53)) 1 0) 0))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_back~0=v_~q1_back~0_53, ~C~0=v_~C~0_30, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_83|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_13|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_5|, ~q1~0.offset=v_~q1~0.offset_27, ~q1_back~0=v_~q1_back~0_52, ~C~0=v_~C~0_30, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_83|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_5|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][37], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 82#L145-4true, 264#true, 196#L101true, 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 242#(<= ~q1_back~0 ~q1_front~0), Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:26,881 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:12:26,881 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:12:26,881 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:12:26,882 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:27,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_15| 256) 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][123], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 124#thread3EXITtrue, Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 82#L145-4true, 264#true, 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 35#thread1EXITtrue, Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,114 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,114 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,114 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:27,114 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:27,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([969] L101-->L98: Formula: (and (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| (+ (select (select |v_#memory_int_99| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_55))) v_~total~0_84)) (<= v_~total~0_83 2147483647) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_11| 256) 0)) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_56)) 1 0) 0)) (<= 0 (+ v_~total~0_83 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_83)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_56, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, ~total~0=v_~total~0_84} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_5|, ~total~0=v_~total~0_83, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_5|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_5|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_56, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][176], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 491#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 82#L145-4true, 264#true, 149#L98true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 35#thread1EXITtrue, Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,115 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,115 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,115 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:27,115 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:27,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([948] L56-->L62: Formula: (and (= v_~i~0_14 (+ v_~i~0_15 1)) (= (ite (= (ite (< v_~i~0_14 v_~N~0_18) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork1_~cond~0#1_15|)) InVars {~i~0=v_~i~0_15, ~N~0=v_~N~0_18} OutVars{~i~0=v_~i~0_14, thread1Thread1of1ForFork1_#t~post3#1=|v_thread1Thread1of1ForFork1_#t~post3#1_5|, ~N~0=v_~N~0_18, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_15|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork1_#t~post3#1, thread1Thread1of1ForFork1_~cond~0#1][147], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 133#L146-1true, Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 264#true, 196#L101true, 68#L62true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 487#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,160 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:12:27,160 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:12:27,161 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:27,161 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:27,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([969] L101-->L98: Formula: (and (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| (+ (select (select |v_#memory_int_99| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_55))) v_~total~0_84)) (<= v_~total~0_83 2147483647) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_11| 256) 0)) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_56)) 1 0) 0)) (<= 0 (+ v_~total~0_83 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_83)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_56, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, ~total~0=v_~total~0_84} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_5|, ~total~0=v_~total~0_83, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_5|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_5|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_56, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][177], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 133#L146-1true, Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 264#true, 484#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 149#L98true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,162 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:12:27,162 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:12:27,162 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:27,162 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:27,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_15| 256) 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][123], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 133#L146-1true, 124#thread3EXITtrue, Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 264#true, 68#L62true, 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 644#true, Black: 247#(<= ~q2_back~0 ~q2_front~0), 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,163 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,163 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:27,163 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:27,163 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([969] L101-->L98: Formula: (and (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| (+ (select (select |v_#memory_int_99| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_55))) v_~total~0_84)) (<= v_~total~0_83 2147483647) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_11| 256) 0)) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_56)) 1 0) 0)) (<= 0 (+ v_~total~0_83 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_83)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_56, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, ~total~0=v_~total~0_84} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_5|, ~total~0=v_~total~0_83, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_5|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_5|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_56, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][176], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 161#L116true, Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 491#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 133#L146-1true, Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 264#true, 68#L62true, 149#L98true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,164 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,164 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:27,164 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:27,164 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,165 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([921] L62-->L56: Formula: (and (not (= (ite (= (select (select |v_#memory_int_83| v_~q1~0.base_27) (+ v_~q1~0.offset_27 (* 4 v_~q1_back~0_53))) v_~C~0_30) 1 0) 0)) (not (= (mod |v_thread1Thread1of1ForFork1_~cond~0#1_13| 256) 0)) (= (+ 1 v_~q1_back~0_53) v_~q1_back~0_52) (not (= (ite (and (< v_~q1_back~0_53 v_~n1~0_22) (<= 0 v_~q1_back~0_53)) 1 0) 0))) InVars {~q1~0.offset=v_~q1~0.offset_27, ~q1_back~0=v_~q1_back~0_53, ~C~0=v_~C~0_30, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_83|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_13|} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_5|, ~q1~0.offset=v_~q1~0.offset_27, ~q1_back~0=v_~q1_back~0_52, ~C~0=v_~C~0_30, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_27, #memory_int=|v_#memory_int_83|, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_5|, thread1Thread1of1ForFork1_~cond~0#1=|v_thread1Thread1of1ForFork1_~cond~0#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, ~q1_back~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][37], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 133#L146-1true, Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 264#true, 196#L101true, 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 644#true, Black: 247#(<= ~q2_back~0 ~q2_front~0), 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,165 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,165 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:27,165 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,165 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:12:27,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_15| 256) 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][123], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 161#L116true, Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), Black: 260#(<= ~n2~0 0), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 133#L146-1true, Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 124#thread3EXITtrue, Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 264#true, 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 35#thread1EXITtrue, Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,273 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 22:12:27,273 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:27,274 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:27,274 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:27,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([969] L101-->L98: Formula: (and (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| (+ (select (select |v_#memory_int_99| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_55))) v_~total~0_84)) (<= v_~total~0_83 2147483647) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_11| 256) 0)) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_56)) 1 0) 0)) (<= 0 (+ v_~total~0_83 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_83)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_56, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, ~total~0=v_~total~0_84} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_5|, ~total~0=v_~total~0_83, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_5|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_5|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_56, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][176], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 161#L116true, Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 491#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 133#L146-1true, Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 264#true, 149#L98true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 35#thread1EXITtrue, Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,274 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 22:12:27,274 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:27,274 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:27,275 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:12:27,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_15| 256) 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][123], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 124#thread3EXITtrue, Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 264#true, 204#L146-2true, 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 644#true, Black: 247#(<= ~q2_back~0 ~q2_front~0), 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,372 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-06 22:12:27,372 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:27,372 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,372 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([969] L101-->L98: Formula: (and (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| (+ (select (select |v_#memory_int_99| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_55))) v_~total~0_84)) (<= v_~total~0_83 2147483647) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_11| 256) 0)) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_56)) 1 0) 0)) (<= 0 (+ v_~total~0_83 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_83)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_56, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, ~total~0=v_~total~0_84} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_5|, ~total~0=v_~total~0_83, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_5|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_5|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_56, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][176], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 491#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 264#true, 204#L146-2true, 149#L98true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,372 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-06 22:12:27,373 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:27,373 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,373 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:12:27,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_15| 256) 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][123], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 124#thread3EXITtrue, Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 264#true, 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 644#true, Black: 247#(<= ~q2_back~0 ~q2_front~0), 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), 55#L147-1true, Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,438 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-06 22:12:27,438 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:27,438 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:27,438 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:27,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([969] L101-->L98: Formula: (and (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| (+ (select (select |v_#memory_int_99| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_55))) v_~total~0_84)) (<= v_~total~0_83 2147483647) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_11| 256) 0)) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_56)) 1 0) 0)) (<= 0 (+ v_~total~0_83 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_83)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_56, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, ~total~0=v_~total~0_84} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_5|, ~total~0=v_~total~0_83, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_5|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_5|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_56, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][176], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 491#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 46#thread2EXITtrue, 264#true, 149#L98true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 644#true, Black: 247#(<= ~q2_back~0 ~q2_front~0), 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), 55#L147-1true, Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,439 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-06 22:12:27,439 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:27,439 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:12:27,439 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:27,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_15| 256) 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][123], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 124#thread3EXITtrue, Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 264#true, 73#L147-2true, 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,480 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-06 22:12:27,480 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:27,480 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:27,480 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:27,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([969] L101-->L98: Formula: (and (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| (+ (select (select |v_#memory_int_99| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_55))) v_~total~0_84)) (<= v_~total~0_83 2147483647) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_11| 256) 0)) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_56)) 1 0) 0)) (<= 0 (+ v_~total~0_83 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_83)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_56, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, ~total~0=v_~total~0_84} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_5|, ~total~0=v_~total~0_83, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_5|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_5|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_56, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][176], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 491#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 264#true, 73#L147-2true, 149#L98true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,481 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-06 22:12:27,481 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:27,481 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:12:27,481 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:12:27,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_15| 256) 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][123], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 124#thread3EXITtrue, Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 264#true, 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 199#L148-1true, Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,506 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-06 22:12:27,506 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:27,506 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:27,506 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:27,506 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([969] L101-->L98: Formula: (and (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| (+ (select (select |v_#memory_int_99| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_55))) v_~total~0_84)) (<= v_~total~0_83 2147483647) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_11| 256) 0)) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_56)) 1 0) 0)) (<= 0 (+ v_~total~0_83 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_83)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_56, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, ~total~0=v_~total~0_84} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_5|, ~total~0=v_~total~0_83, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_5|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_5|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_56, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][176], [Black: 629#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)), Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), 161#L116true, Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 491#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 271#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), 264#true, 149#L98true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 199#L148-1true, Black: 247#(<= ~q2_back~0 ~q2_front~0), 644#true, 521#true, Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:12:27,507 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-06 22:12:27,507 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:27,507 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:12:27,507 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:12:27,553 INFO L124 PetriNetUnfolderBase]: 14505/21673 cut-off events. [2023-11-06 22:12:27,553 INFO L125 PetriNetUnfolderBase]: For 68529/69576 co-relation queries the response was YES. [2023-11-06 22:12:27,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84355 conditions, 21673 events. 14505/21673 cut-off events. For 68529/69576 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 151088 event pairs, 2525 based on Foata normal form. 1130/22247 useless extension candidates. Maximal degree in co-relation 75182. Up to 14630 conditions per place. [2023-11-06 22:12:27,792 INFO L140 encePairwiseOnDemand]: 449/458 looper letters, 150 selfloop transitions, 45 changer transitions 16/221 dead transitions. [2023-11-06 22:12:27,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 221 transitions, 1919 flow [2023-11-06 22:12:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:12:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:12:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1523 transitions. [2023-11-06 22:12:27,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4750467872738615 [2023-11-06 22:12:27,800 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1523 transitions. [2023-11-06 22:12:27,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1523 transitions. [2023-11-06 22:12:27,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:27,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1523 transitions. [2023-11-06 22:12:27,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 217.57142857142858) internal successors, (1523), 7 states have internal predecessors, (1523), 0 states have call successors, (0), 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,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 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,815 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 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,815 INFO L175 Difference]: Start difference. First operand has 94 places, 116 transitions, 951 flow. Second operand 7 states and 1523 transitions. [2023-11-06 22:12:27,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 221 transitions, 1919 flow [2023-11-06 22:12:28,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 221 transitions, 1886 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:28,107 INFO L231 Difference]: Finished difference. Result has 102 places, 117 transitions, 1070 flow [2023-11-06 22:12:28,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1070, PETRI_PLACES=102, PETRI_TRANSITIONS=117} [2023-11-06 22:12:28,108 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 58 predicate places. [2023-11-06 22:12:28,108 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 117 transitions, 1070 flow [2023-11-06 22:12:28,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 203.28571428571428) internal successors, (1423), 7 states have internal predecessors, (1423), 0 states have call successors, (0), 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:28,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:28,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:28,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:12:28,110 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:28,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash 9963250, now seen corresponding path program 5 times [2023-11-06 22:12:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:28,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407406507] [2023-11-06 22:12:28,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:28,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:28,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407406507] [2023-11-06 22:12:28,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407406507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:28,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:28,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:12:28,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792095308] [2023-11-06 22:12:28,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:28,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:12:28,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:28,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:12:28,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:12:28,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-11-06 22:12:28,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 117 transitions, 1070 flow. Second operand has 6 states, 6 states have (on average 205.83333333333334) internal successors, (1235), 6 states have internal predecessors, (1235), 0 states have call successors, (0), 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:28,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:28,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-11-06 22:12:28,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:35,759 INFO L124 PetriNetUnfolderBase]: 30930/45360 cut-off events. [2023-11-06 22:12:35,759 INFO L125 PetriNetUnfolderBase]: For 138845/138931 co-relation queries the response was YES. [2023-11-06 22:12:36,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173152 conditions, 45360 events. 30930/45360 cut-off events. For 138845/138931 co-relation queries the response was YES. Maximal size of possible extension queue 2416. Compared 332846 event pairs, 5286 based on Foata normal form. 752/46072 useless extension candidates. Maximal degree in co-relation 161185. Up to 16420 conditions per place. [2023-11-06 22:12:36,412 INFO L140 encePairwiseOnDemand]: 450/458 looper letters, 255 selfloop transitions, 95 changer transitions 27/385 dead transitions. [2023-11-06 22:12:36,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 385 transitions, 3613 flow [2023-11-06 22:12:36,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:12:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:12:36,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2204 transitions. [2023-11-06 22:12:36,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4812227074235808 [2023-11-06 22:12:36,430 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2204 transitions. [2023-11-06 22:12:36,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2204 transitions. [2023-11-06 22:12:36,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:36,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2204 transitions. [2023-11-06 22:12:36,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 220.4) internal successors, (2204), 10 states have internal predecessors, (2204), 0 states have call successors, (0), 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:36,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 458.0) internal successors, (5038), 11 states have internal predecessors, (5038), 0 states have call successors, (0), 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:36,447 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 458.0) internal successors, (5038), 11 states have internal predecessors, (5038), 0 states have call successors, (0), 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:36,447 INFO L175 Difference]: Start difference. First operand has 102 places, 117 transitions, 1070 flow. Second operand 10 states and 2204 transitions. [2023-11-06 22:12:36,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 385 transitions, 3613 flow [2023-11-06 22:12:37,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 385 transitions, 3496 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-06 22:12:37,822 INFO L231 Difference]: Finished difference. Result has 114 places, 174 transitions, 1906 flow [2023-11-06 22:12:37,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1906, PETRI_PLACES=114, PETRI_TRANSITIONS=174} [2023-11-06 22:12:37,823 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 70 predicate places. [2023-11-06 22:12:37,824 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 174 transitions, 1906 flow [2023-11-06 22:12:37,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.83333333333334) internal successors, (1235), 6 states have internal predecessors, (1235), 0 states have call successors, (0), 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:37,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:37,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:37,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:12:37,825 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:37,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:37,825 INFO L85 PathProgramCache]: Analyzing trace with hash 307802230, now seen corresponding path program 6 times [2023-11-06 22:12:37,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:37,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043680497] [2023-11-06 22:12:37,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:37,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:12:38,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:38,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043680497] [2023-11-06 22:12:38,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043680497] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:12:38,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163527249] [2023-11-06 22:12:38,134 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:12:38,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:38,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:12:38,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:12:38,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:12:38,332 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-06 22:12:38,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:12:38,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:12:38,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:12:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:38,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:12:38,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163527249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:38,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:12:38,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2023-11-06 22:12:38,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703776452] [2023-11-06 22:12:38,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:38,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:12:38,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:38,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:12:38,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:12:38,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 458 [2023-11-06 22:12:38,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 174 transitions, 1906 flow. Second operand has 6 states, 6 states have (on average 204.83333333333334) internal successors, (1229), 6 states have internal predecessors, (1229), 0 states have call successors, (0), 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:38,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:38,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 458 [2023-11-06 22:12:38,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:12:46,644 INFO L124 PetriNetUnfolderBase]: 34131/49557 cut-off events. [2023-11-06 22:12:46,644 INFO L125 PetriNetUnfolderBase]: For 202190/202340 co-relation queries the response was YES. [2023-11-06 22:12:46,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204358 conditions, 49557 events. 34131/49557 cut-off events. For 202190/202340 co-relation queries the response was YES. Maximal size of possible extension queue 2614. Compared 361114 event pairs, 7242 based on Foata normal form. 448/49995 useless extension candidates. Maximal degree in co-relation 187847. Up to 27254 conditions per place. [2023-11-06 22:12:47,154 INFO L140 encePairwiseOnDemand]: 450/458 looper letters, 211 selfloop transitions, 127 changer transitions 5/351 dead transitions. [2023-11-06 22:12:47,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 351 transitions, 3936 flow [2023-11-06 22:12:47,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:12:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:12:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1518 transitions. [2023-11-06 22:12:47,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47348721147847783 [2023-11-06 22:12:47,162 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1518 transitions. [2023-11-06 22:12:47,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1518 transitions. [2023-11-06 22:12:47,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:12:47,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1518 transitions. [2023-11-06 22:12:47,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 216.85714285714286) internal successors, (1518), 7 states have internal predecessors, (1518), 0 states have call successors, (0), 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:47,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 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:47,176 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 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:47,177 INFO L175 Difference]: Start difference. First operand has 114 places, 174 transitions, 1906 flow. Second operand 7 states and 1518 transitions. [2023-11-06 22:12:47,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 351 transitions, 3936 flow [2023-11-06 22:12:51,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 351 transitions, 3905 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-06 22:12:51,178 INFO L231 Difference]: Finished difference. Result has 123 places, 232 transitions, 2992 flow [2023-11-06 22:12:51,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2992, PETRI_PLACES=123, PETRI_TRANSITIONS=232} [2023-11-06 22:12:51,179 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 79 predicate places. [2023-11-06 22:12:51,179 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 232 transitions, 2992 flow [2023-11-06 22:12:51,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 204.83333333333334) internal successors, (1229), 6 states have internal predecessors, (1229), 0 states have call successors, (0), 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:51,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:12:51,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:12:51,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:12:51,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3c949c4-3a4a-4b29-aae0-bff3b6331da8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:12:51,386 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:12:51,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:12:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash 264448774, now seen corresponding path program 7 times [2023-11-06 22:12:51,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:12:51,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704116328] [2023-11-06 22:12:51,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:12:51,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:12:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:12:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:12:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:12:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704116328] [2023-11-06 22:12:51,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704116328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:12:51,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:12:51,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:12:51,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293163803] [2023-11-06 22:12:51,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:12:51,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:12:51,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:12:51,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:12:51,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:12:52,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 458 [2023-11-06 22:12:52,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 232 transitions, 2992 flow. Second operand has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 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:52,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:12:52,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 458 [2023-11-06 22:12:52,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:13:01,064 INFO L124 PetriNetUnfolderBase]: 34991/50743 cut-off events. [2023-11-06 22:13:01,064 INFO L125 PetriNetUnfolderBase]: For 267221/267299 co-relation queries the response was YES. [2023-11-06 22:13:01,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228879 conditions, 50743 events. 34991/50743 cut-off events. For 267221/267299 co-relation queries the response was YES. Maximal size of possible extension queue 2687. Compared 371680 event pairs, 6116 based on Foata normal form. 158/50849 useless extension candidates. Maximal degree in co-relation 208637. Up to 38861 conditions per place. [2023-11-06 22:13:01,546 INFO L140 encePairwiseOnDemand]: 449/458 looper letters, 268 selfloop transitions, 112 changer transitions 28/416 dead transitions. [2023-11-06 22:13:01,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 416 transitions, 5406 flow [2023-11-06 22:13:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:13:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:13:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1710 transitions. [2023-11-06 22:13:01,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46670305676855894 [2023-11-06 22:13:01,555 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1710 transitions. [2023-11-06 22:13:01,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1710 transitions. [2023-11-06 22:13:01,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:13:01,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1710 transitions. [2023-11-06 22:13:01,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 213.75) internal successors, (1710), 8 states have internal predecessors, (1710), 0 states have call successors, (0), 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:13:01,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 458.0) internal successors, (4122), 9 states have internal predecessors, (4122), 0 states have call successors, (0), 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:13:01,571 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 458.0) internal successors, (4122), 9 states have internal predecessors, (4122), 0 states have call successors, (0), 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:13:01,571 INFO L175 Difference]: Start difference. First operand has 123 places, 232 transitions, 2992 flow. Second operand 8 states and 1710 transitions. [2023-11-06 22:13:01,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 416 transitions, 5406 flow [2023-11-06 22:13:13,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 416 transitions, 5361 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-11-06 22:13:13,428 INFO L231 Difference]: Finished difference. Result has 135 places, 284 transitions, 4118 flow [2023-11-06 22:13:13,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=2959, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4118, PETRI_PLACES=135, PETRI_TRANSITIONS=284} [2023-11-06 22:13:13,430 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 91 predicate places. [2023-11-06 22:13:13,430 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 284 transitions, 4118 flow [2023-11-06 22:13:13,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 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:13:13,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:13:13,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:13:13,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:13:13,432 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:13:13,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:13:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash -595541472, now seen corresponding path program 8 times [2023-11-06 22:13:13,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:13:13,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462633177] [2023-11-06 22:13:13,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:13:13,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:13:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:13:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:13:13,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:13:13,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462633177] [2023-11-06 22:13:13,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462633177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:13:13,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:13:13,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:13:13,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287533761] [2023-11-06 22:13:13,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:13:13,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:13:13,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:13:13,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:13:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:13:14,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 458 [2023-11-06 22:13:14,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 284 transitions, 4118 flow. Second operand has 6 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 0 states have call successors, (0), 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:13:14,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:13:14,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 458 [2023-11-06 22:13:14,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:13:17,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([969] L101-->L98: Formula: (and (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| (+ (select (select |v_#memory_int_99| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_55))) v_~total~0_84)) (<= v_~total~0_83 2147483647) (= (+ v_~q1_front~0_55 1) v_~q1_front~0_54) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_11| 256) 0)) (not (= (ite (and (< v_~q1_front~0_55 v_~n1~0_26) (<= 0 v_~q1_front~0_55) (< v_~q1_front~0_55 v_~q1_back~0_56)) 1 0) 0)) (<= 0 (+ v_~total~0_83 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_83)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_55, ~q1_back~0=v_~q1_back~0_56, ~n1~0=v_~n1~0_26, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, ~total~0=v_~total~0_84} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_54, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_26, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_11|, thread3Thread1of1ForFork0_#t~mem7#1=|v_thread3Thread1of1ForFork0_#t~mem7#1_5|, ~total~0=v_~total~0_83, thread3Thread1of1ForFork0_#t~ret8#1=|v_thread3Thread1of1ForFork0_#t~ret8#1_5|, thread3Thread1of1ForFork0_#t~post9#1=|v_thread3Thread1of1ForFork0_#t~post9#1_5|, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_56, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_99|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_#t~ret8#1, thread3Thread1of1ForFork0_#t~post9#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_plus_~b#1, thread3Thread1of1ForFork0_#t~mem7#1, ~total~0][226], [Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 491#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 652#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 658#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 656#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 719#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 789#(and (<= ~i~0 0) (<= (+ ~j~0 1) ~N~0) (<= 0 ~j~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 791#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= ~i~0 0) (<= (+ ~j~0 1) ~N~0) (<= 0 ~j~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 751#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~j~0 1) ~N~0) (<= 0 ~j~0)), Black: 666#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (<= ~N~0 0))), Black: 667#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))), Black: 674#(and (= ~j~0 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 670#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 808#(and (= ~j~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 672#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 0)) (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 668#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 806#(and (= ~j~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= ~i~0 0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= ~N~0 0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 801#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (or (< 0 |thread3Thread1of1ForFork0_~cond~2#1|) (and (= ~j~0 0) (<= ~N~0 0))) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 676#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (= ~j~0 0)) (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 799#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 800#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 804#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (or (< 0 |thread3Thread1of1ForFork0_~cond~2#1|) (and (= ~j~0 0) (<= ~N~0 0))) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 685#true, 103#L83true, 797#true, 264#true, 29#L144-4true, 149#L98true, Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 35#thread1EXITtrue, Black: 247#(<= ~q2_back~0 ~q2_front~0), Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), 663#true, 816#true, Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:13:17,550 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:13:17,550 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:13:17,550 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:13:17,550 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:13:17,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1035] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread3Thread1of1ForFork0_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_15| 256) 0)) InVars {thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} OutVars{thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_9|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_9|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_15|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#res#1.base][137], [Black: 252#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 631#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 530#(and (= ~j~0 0) (= ~i~0 0)), Black: 504#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0)), Black: 506#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)), Black: 635#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 505#(and (= ~j~0 0) (<= ~N~0 0)), Black: 260#(<= ~n2~0 0), Black: 508#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 502#(and (= ~j~0 0) (= ~i~0 0)), 124#thread3EXITtrue, Black: 652#(and (or (and (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)) (and (<= 1 ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 266#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)), Black: 658#(and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 267#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 656#(and (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), Black: 719#(and (<= ~i~0 0) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (<= 0 ~j~0)), Black: 789#(and (<= ~i~0 0) (<= (+ ~j~0 1) ~N~0) (<= 0 ~j~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 791#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= ~i~0 0) (<= (+ ~j~0 1) ~N~0) (<= 0 ~j~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 751#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (<= (+ ~j~0 1) ~N~0) (<= 0 ~j~0)), Black: 666#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= ~j~0 0) (<= ~N~0 0))), Black: 667#(or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))), Black: 674#(and (= ~j~0 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 670#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 808#(and (= ~j~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 672#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 0)) (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (< ~N~0 1)) (= ~j~0 0) (= ~i~0 0)), Black: 668#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 806#(and (= ~j~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (or (= ~i~0 0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= ~N~0 0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 676#(and (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (= ~j~0 0)) (or (and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 801#(and (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (or (< 0 |thread3Thread1of1ForFork0_~cond~2#1|) (and (= ~j~0 0) (<= ~N~0 0))) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 799#(or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 800#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0)))), Black: 804#(and (or (and (= ~j~0 0) (= ~i~0 0)) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (and (<= (+ ~j~0 1) ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 ~j~0))) (or (< 0 |thread3Thread1of1ForFork0_~cond~2#1|) (and (= ~j~0 0) (<= ~N~0 0))) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 685#true, 103#L83true, 797#true, 264#true, 29#L144-4true, 478#(and (or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 237#(= ~total~0 0), Black: 281#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 421#(or (< ~q1_front~0 0) (< ~q1_back~0 (+ ~q1_front~0 1)) (< ~i~0 ~N~0) (= (mod |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 481#(and (<= 1 ~q1_back~0) (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 242#(<= ~q1_back~0 ~q1_front~0), 35#thread1EXITtrue, Black: 247#(<= ~q2_back~0 ~q2_front~0), Black: 627#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)))), 816#true, Black: 633#(and (= ~i~0 0) (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0) (= |thread1Thread1of1ForFork1_~cond~0#1| 0)), 663#true, Black: 253#(<= ~n1~0 0), Black: 625#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (<= ~N~0 0)) (and (<= 1 ~N~0) (= |thread2Thread1of1ForFork3_~cond~1#1| 1))))]) [2023-11-06 22:13:17,551 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:13:17,551 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:13:17,551 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:13:17,551 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event