./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:49:56,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:49:56,482 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:49:56,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:49:56,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:49:56,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:49:56,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:49:56,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:49:56,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:49:56,511 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:49:56,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:49:56,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:49:56,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:49:56,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:49:56,514 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:49:56,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:49:56,515 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:49:56,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:49:56,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:49:56,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:49:56,517 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:49:56,518 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:49:56,518 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:49:56,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:49:56,519 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:49:56,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:49:56,520 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:49:56,520 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:49:56,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:49:56,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:49:56,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:49:56,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:49:56,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:49:56,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:49:56,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:49:56,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:49:56,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:49:56,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:49:56,524 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:49:56,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:49:56,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:49:56,525 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_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/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_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 [2023-11-29 05:49:56,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:49:56,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:49:56,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:49:56,749 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:49:56,749 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:49:56,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 05:49:59,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:49:59,858 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:49:59,858 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 05:49:59,874 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/data/ceb965498/77bfa63ce1684a5bbb25a4f56dda1d4d/FLAG0f16df2d5 [2023-11-29 05:49:59,888 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/data/ceb965498/77bfa63ce1684a5bbb25a4f56dda1d4d [2023-11-29 05:49:59,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:49:59,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:49:59,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:49:59,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:49:59,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:49:59,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:49:59" (1/1) ... [2023-11-29 05:49:59,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6027d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:49:59, skipping insertion in model container [2023-11-29 05:49:59,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:49:59" (1/1) ... [2023-11-29 05:49:59,951 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:50:00,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:50:00,281 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:50:00,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:50:00,379 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:50:00,379 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:50:00,388 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:50:00,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00 WrapperNode [2023-11-29 05:50:00,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:50:00,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:50:00,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:50:00,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:50:00,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,437 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-29 05:50:00,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:50:00,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:50:00,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:50:00,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:50:00,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,475 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 05:50:00,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:50:00,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:50:00,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:50:00,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:50:00,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (1/1) ... [2023-11-29 05:50:00,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:50:00,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:50:00,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:50:00,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:50:00,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:50:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:50:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:50:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:50:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:50:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:50:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:50:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:50:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:50:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:50:00,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:50:00,575 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:50:00,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:50:00,576 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:50:00,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:50:00,576 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:50:00,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:50:00,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:50:00,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:50:00,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:50:00,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:50:00,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:50:00,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:50:00,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:50:00,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:50:00,581 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:50:00,748 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:50:00,751 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:50:01,110 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:50:01,347 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:50:01,347 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:50:01,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:50:01 BoogieIcfgContainer [2023-11-29 05:50:01,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:50:01,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:50:01,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:50:01,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:50:01,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:49:59" (1/3) ... [2023-11-29 05:50:01,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e8447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:50:01, skipping insertion in model container [2023-11-29 05:50:01,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:50:00" (2/3) ... [2023-11-29 05:50:01,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e8447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:50:01, skipping insertion in model container [2023-11-29 05:50:01,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:50:01" (3/3) ... [2023-11-29 05:50:01,356 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 05:50:01,375 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:50:01,375 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:50:01,375 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:50:01,437 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:50:01,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:50:01,518 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 05:50:01,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:50:01,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-29 05:50:01,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:50:01,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 05:50:01,539 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:50:01,547 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@31c78116, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:50:01,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:50:01,551 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:50:01,551 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:50:01,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:50:01,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:01,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:50:01,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:01,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:01,558 INFO L85 PathProgramCache]: Analyzing trace with hash 14397, now seen corresponding path program 1 times [2023-11-29 05:50:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:01,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194650906] [2023-11-29 05:50:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:01,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:01,827 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-29 05:50:01,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:01,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194650906] [2023-11-29 05:50:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194650906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:01,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:50:01,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497376640] [2023-11-29 05:50:01,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:01,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:01,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:01,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:01,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:01,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:50:01,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:01,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:01,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:50:01,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:03,224 INFO L124 PetriNetUnfolderBase]: 4217/7253 cut-off events. [2023-11-29 05:50:03,224 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 05:50:03,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13180 conditions, 7253 events. 4217/7253 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54704 event pairs, 3179 based on Foata normal form. 360/6961 useless extension candidates. Maximal degree in co-relation 13165. Up to 4391 conditions per place. [2023-11-29 05:50:03,329 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-29 05:50:03,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 228 flow [2023-11-29 05:50:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 05:50:03,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 05:50:03,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 05:50:03,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 05:50:03,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:03,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 05:50:03,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:03,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:03,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:03,351 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 149 transitions. [2023-11-29 05:50:03,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 228 flow [2023-11-29 05:50:03,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:50:03,361 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 05:50:03,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-29 05:50:03,366 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 05:50:03,366 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 05:50:03,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:03,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:03,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:50:03,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:50:03,367 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:03,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash 14398, now seen corresponding path program 1 times [2023-11-29 05:50:03,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:03,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685608357] [2023-11-29 05:50:03,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:03,474 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-29 05:50:03,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:03,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685608357] [2023-11-29 05:50:03,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685608357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:03,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:03,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:50:03,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663873242] [2023-11-29 05:50:03,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:03,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:03,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:03,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:03,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:03,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 05:50:03,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:03,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:03,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 05:50:03,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:04,644 INFO L124 PetriNetUnfolderBase]: 4217/7252 cut-off events. [2023-11-29 05:50:04,645 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 05:50:04,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13356 conditions, 7252 events. 4217/7252 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54830 event pairs, 3179 based on Foata normal form. 1/6601 useless extension candidates. Maximal degree in co-relation 13345. Up to 4390 conditions per place. [2023-11-29 05:50:04,713 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 05:50:04,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 224 flow [2023-11-29 05:50:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 05:50:04,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 05:50:04,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 05:50:04,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 05:50:04,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:04,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 05:50:04,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:04,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:04,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:04,720 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 149 transitions. [2023-11-29 05:50:04,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 224 flow [2023-11-29 05:50:04,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:50:04,736 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 05:50:04,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 05:50:04,737 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 05:50:04,738 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 05:50:04,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:04,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:04,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:50:04,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:50:04,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:04,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:04,739 INFO L85 PathProgramCache]: Analyzing trace with hash 429340393, now seen corresponding path program 1 times [2023-11-29 05:50:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:04,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85239902] [2023-11-29 05:50:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:04,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:04,800 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-29 05:50:04,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:04,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85239902] [2023-11-29 05:50:04,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85239902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:04,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:04,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:50:04,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152091020] [2023-11-29 05:50:04,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:04,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:04,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:04,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:04,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:04,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:50:04,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:04,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:04,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:50:04,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:06,113 INFO L124 PetriNetUnfolderBase]: 4221/7215 cut-off events. [2023-11-29 05:50:06,114 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 05:50:06,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13328 conditions, 7215 events. 4221/7215 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54412 event pairs, 3251 based on Foata normal form. 0/6573 useless extension candidates. Maximal degree in co-relation 13317. Up to 4393 conditions per place. [2023-11-29 05:50:06,174 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 05:50:06,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 224 flow [2023-11-29 05:50:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2023-11-29 05:50:06,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-29 05:50:06,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 147 transitions. [2023-11-29 05:50:06,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 147 transitions. [2023-11-29 05:50:06,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:06,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 147 transitions. [2023-11-29 05:50:06,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:06,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:06,180 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:06,180 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 147 transitions. [2023-11-29 05:50:06,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 224 flow [2023-11-29 05:50:06,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:50:06,188 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:50:06,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-29 05:50:06,189 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 05:50:06,189 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:50:06,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:06,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:06,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:50:06,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:50:06,190 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:06,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:06,191 INFO L85 PathProgramCache]: Analyzing trace with hash 429340394, now seen corresponding path program 1 times [2023-11-29 05:50:06,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:06,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811806331] [2023-11-29 05:50:06,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:06,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:06,263 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-29 05:50:06,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:06,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811806331] [2023-11-29 05:50:06,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811806331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:06,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:06,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:50:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578297716] [2023-11-29 05:50:06,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:06,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:06,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:06,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:06,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 05:50:06,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:06,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:06,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 05:50:06,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:07,230 INFO L124 PetriNetUnfolderBase]: 4217/7242 cut-off events. [2023-11-29 05:50:07,230 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-29 05:50:07,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13350 conditions, 7242 events. 4217/7242 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 55230 event pairs, 2503 based on Foata normal form. 5/6608 useless extension candidates. Maximal degree in co-relation 13340. Up to 4384 conditions per place. [2023-11-29 05:50:07,288 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 05:50:07,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-29 05:50:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 05:50:07,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 05:50:07,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 05:50:07,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 05:50:07,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:07,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 05:50:07,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:07,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:07,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:07,295 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 149 transitions. [2023-11-29 05:50:07,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-29 05:50:07,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:50:07,299 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 05:50:07,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-29 05:50:07,301 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 05:50:07,301 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 05:50:07,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:07,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:07,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:50:07,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:50:07,302 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:07,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash 429342016, now seen corresponding path program 1 times [2023-11-29 05:50:07,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:07,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649536099] [2023-11-29 05:50:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:07,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:50:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:07,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649536099] [2023-11-29 05:50:07,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649536099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:07,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:07,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:50:07,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607898753] [2023-11-29 05:50:07,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:07,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:07,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:07,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:07,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:50:07,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:07,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:07,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:50:07,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:08,102 INFO L124 PetriNetUnfolderBase]: 3311/5479 cut-off events. [2023-11-29 05:50:08,103 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 05:50:08,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10304 conditions, 5479 events. 3311/5479 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39618 event pairs, 593 based on Foata normal form. 0/5397 useless extension candidates. Maximal degree in co-relation 10294. Up to 3661 conditions per place. [2023-11-29 05:50:08,128 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-29 05:50:08,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 262 flow [2023-11-29 05:50:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-29 05:50:08,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7960199004975125 [2023-11-29 05:50:08,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-29 05:50:08,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-29 05:50:08,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:08,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-29 05:50:08,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:08,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:08,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:08,132 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 160 transitions. [2023-11-29 05:50:08,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 262 flow [2023-11-29 05:50:08,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:50:08,135 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-29 05:50:08,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-29 05:50:08,136 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-29 05:50:08,137 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-29 05:50:08,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:08,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:08,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:08,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:50:08,138 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:08,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash 67484712, now seen corresponding path program 1 times [2023-11-29 05:50:08,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:08,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441145359] [2023-11-29 05:50:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:08,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:08,183 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-29 05:50:08,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441145359] [2023-11-29 05:50:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441145359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:50:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122763399] [2023-11-29 05:50:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:08,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:08,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:08,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:50:08,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:08,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:08,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:50:08,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:08,765 INFO L124 PetriNetUnfolderBase]: 2920/5185 cut-off events. [2023-11-29 05:50:08,765 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-29 05:50:08,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9621 conditions, 5185 events. 2920/5185 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 38384 event pairs, 1356 based on Foata normal form. 0/4950 useless extension candidates. Maximal degree in co-relation 9610. Up to 3460 conditions per place. [2023-11-29 05:50:08,792 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 05:50:08,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 210 flow [2023-11-29 05:50:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:08,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 05:50:08,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 05:50:08,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 05:50:08,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 05:50:08,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:08,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 05:50:08,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:08,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:08,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:08,796 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-29 05:50:08,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 210 flow [2023-11-29 05:50:08,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:50:08,798 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 05:50:08,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-29 05:50:08,799 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 05:50:08,799 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 05:50:08,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:08,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:08,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:08,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:50:08,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:08,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:08,800 INFO L85 PathProgramCache]: Analyzing trace with hash 67484713, now seen corresponding path program 1 times [2023-11-29 05:50:08,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:08,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709921700] [2023-11-29 05:50:08,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:08,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:08,871 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-29 05:50:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709921700] [2023-11-29 05:50:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709921700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:08,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:08,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:50:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349884068] [2023-11-29 05:50:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:08,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:08,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:08,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:08,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:08,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 05:50:08,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:08,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:08,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 05:50:08,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:09,465 INFO L124 PetriNetUnfolderBase]: 2903/5104 cut-off events. [2023-11-29 05:50:09,465 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:50:09,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9385 conditions, 5104 events. 2903/5104 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 37432 event pairs, 1884 based on Foata normal form. 12/4885 useless extension candidates. Maximal degree in co-relation 9375. Up to 3431 conditions per place. [2023-11-29 05:50:09,499 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 05:50:09,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-29 05:50:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:50:09,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 05:50:09,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:50:09,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:50:09,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:09,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:50:09,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:09,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:09,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:09,504 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:50:09,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-29 05:50:09,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:50:09,507 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 05:50:09,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 05:50:09,507 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 05:50:09,508 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 05:50:09,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:09,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:09,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:09,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:50:09,508 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:09,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:09,509 INFO L85 PathProgramCache]: Analyzing trace with hash 392802744, now seen corresponding path program 1 times [2023-11-29 05:50:09,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:09,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686788170] [2023-11-29 05:50:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:09,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:09,573 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-29 05:50:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:09,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686788170] [2023-11-29 05:50:09,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686788170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:09,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:09,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:50:09,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565532092] [2023-11-29 05:50:09,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:09,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:09,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:09,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:09,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:09,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:50:09,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:09,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:09,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:50:09,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:10,157 INFO L124 PetriNetUnfolderBase]: 2978/5135 cut-off events. [2023-11-29 05:50:10,157 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:50:10,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9527 conditions, 5135 events. 2978/5135 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 37130 event pairs, 1424 based on Foata normal form. 0/4968 useless extension candidates. Maximal degree in co-relation 9517. Up to 3426 conditions per place. [2023-11-29 05:50:10,183 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:50:10,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-29 05:50:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 05:50:10,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 05:50:10,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 05:50:10,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 05:50:10,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:10,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 05:50:10,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:10,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:10,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:10,187 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 144 transitions. [2023-11-29 05:50:10,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-29 05:50:10,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:50:10,190 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 05:50:10,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 05:50:10,191 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 05:50:10,191 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 05:50:10,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:10,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:10,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:50:10,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:50:10,192 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:10,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash 392802745, now seen corresponding path program 1 times [2023-11-29 05:50:10,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:10,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577639085] [2023-11-29 05:50:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:10,270 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-29 05:50:10,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:10,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577639085] [2023-11-29 05:50:10,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577639085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:10,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:10,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:50:10,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053368503] [2023-11-29 05:50:10,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:10,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:50:10,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:10,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:50:10,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:50:10,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 05:50:10,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:10,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:10,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 05:50:10,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:10,778 INFO L124 PetriNetUnfolderBase]: 2903/5084 cut-off events. [2023-11-29 05:50:10,778 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 05:50:10,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9389 conditions, 5084 events. 2903/5084 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 37056 event pairs, 920 based on Foata normal form. 36/4977 useless extension candidates. Maximal degree in co-relation 9379. Up to 3315 conditions per place. [2023-11-29 05:50:10,802 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:50:10,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-29 05:50:10,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:50:10,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:50:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:50:10,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 05:50:10,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:50:10,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:50:10,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:10,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:50:10,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:10,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:10,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:10,805 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:50:10,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-29 05:50:10,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:50:10,807 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 05:50:10,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 05:50:10,808 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-29 05:50:10,808 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 05:50:10,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:10,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:10,809 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] [2023-11-29 05:50:10,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:50:10,809 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:10,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:10,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1649136896, now seen corresponding path program 1 times [2023-11-29 05:50:10,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:10,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992493286] [2023-11-29 05:50:10,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:10,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:11,519 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-29 05:50:11,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:11,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992493286] [2023-11-29 05:50:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992493286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:11,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:11,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:50:11,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390526157] [2023-11-29 05:50:11,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:11,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:50:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:50:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:50:11,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-29 05:50:11,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:11,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:11,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-29 05:50:11,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:13,810 INFO L124 PetriNetUnfolderBase]: 7189/11678 cut-off events. [2023-11-29 05:50:13,811 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2023-11-29 05:50:13,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22130 conditions, 11678 events. 7189/11678 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 88002 event pairs, 1744 based on Foata normal form. 192/11778 useless extension candidates. Maximal degree in co-relation 22119. Up to 4507 conditions per place. [2023-11-29 05:50:13,884 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 67 selfloop transitions, 6 changer transitions 13/108 dead transitions. [2023-11-29 05:50:13,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 108 transitions, 410 flow [2023-11-29 05:50:13,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:50:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:50:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 359 transitions. [2023-11-29 05:50:13,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6697761194029851 [2023-11-29 05:50:13,887 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 359 transitions. [2023-11-29 05:50:13,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 359 transitions. [2023-11-29 05:50:13,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:13,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 359 transitions. [2023-11-29 05:50:13,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 44.875) internal successors, (359), 8 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:13,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:13,891 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:13,892 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 8 states and 359 transitions. [2023-11-29 05:50:13,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 108 transitions, 410 flow [2023-11-29 05:50:13,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:50:13,895 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 138 flow [2023-11-29 05:50:13,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2023-11-29 05:50:13,896 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 05:50:13,897 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 138 flow [2023-11-29 05:50:13,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:13,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:13,897 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] [2023-11-29 05:50:13,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:50:13,898 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:13,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1649138242, now seen corresponding path program 1 times [2023-11-29 05:50:13,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:13,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311816642] [2023-11-29 05:50:13,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:13,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:14,135 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-29 05:50:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311816642] [2023-11-29 05:50:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311816642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:14,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:14,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:50:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145294937] [2023-11-29 05:50:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:14,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:50:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:14,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:50:14,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:50:14,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 67 [2023-11-29 05:50:14,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:14,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:14,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 67 [2023-11-29 05:50:14,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:22,702 INFO L124 PetriNetUnfolderBase]: 61998/90556 cut-off events. [2023-11-29 05:50:22,702 INFO L125 PetriNetUnfolderBase]: For 8937/8985 co-relation queries the response was YES. [2023-11-29 05:50:22,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182848 conditions, 90556 events. 61998/90556 cut-off events. For 8937/8985 co-relation queries the response was YES. Maximal size of possible extension queue 3774. Compared 717954 event pairs, 19570 based on Foata normal form. 3/88448 useless extension candidates. Maximal degree in co-relation 182833. Up to 39043 conditions per place. [2023-11-29 05:50:23,178 INFO L140 encePairwiseOnDemand]: 54/67 looper letters, 116 selfloop transitions, 34 changer transitions 14/182 dead transitions. [2023-11-29 05:50:23,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 182 transitions, 782 flow [2023-11-29 05:50:23,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:50:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:50:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 432 transitions. [2023-11-29 05:50:23,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 05:50:23,181 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 432 transitions. [2023-11-29 05:50:23,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 432 transitions. [2023-11-29 05:50:23,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:23,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 432 transitions. [2023-11-29 05:50:23,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 48.0) internal successors, (432), 9 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:23,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:23,185 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:23,185 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 138 flow. Second operand 9 states and 432 transitions. [2023-11-29 05:50:23,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 182 transitions, 782 flow [2023-11-29 05:50:23,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 182 transitions, 772 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-29 05:50:23,330 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 406 flow [2023-11-29 05:50:23,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=406, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2023-11-29 05:50:23,330 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2023-11-29 05:50:23,331 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 406 flow [2023-11-29 05:50:23,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:23,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:23,331 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] [2023-11-29 05:50:23,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:50:23,331 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:23,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:23,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1010216433, now seen corresponding path program 1 times [2023-11-29 05:50:23,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:23,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848797547] [2023-11-29 05:50:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:23,512 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-29 05:50:23,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848797547] [2023-11-29 05:50:23,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848797547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:23,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:23,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:50:23,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412262713] [2023-11-29 05:50:23,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:23,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:50:23,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:23,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:50:23,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:50:23,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:50:23,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:23,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:23,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:50:23,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:35,138 INFO L124 PetriNetUnfolderBase]: 62146/96687 cut-off events. [2023-11-29 05:50:35,139 INFO L125 PetriNetUnfolderBase]: For 103987/108776 co-relation queries the response was YES. [2023-11-29 05:50:35,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274291 conditions, 96687 events. 62146/96687 cut-off events. For 103987/108776 co-relation queries the response was YES. Maximal size of possible extension queue 4732. Compared 872226 event pairs, 15626 based on Foata normal form. 1917/97121 useless extension candidates. Maximal degree in co-relation 274270. Up to 38551 conditions per place. [2023-11-29 05:50:36,082 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 95 selfloop transitions, 31 changer transitions 0/166 dead transitions. [2023-11-29 05:50:36,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 166 transitions, 987 flow [2023-11-29 05:50:36,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:50:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:50:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 372 transitions. [2023-11-29 05:50:36,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6940298507462687 [2023-11-29 05:50:36,085 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 372 transitions. [2023-11-29 05:50:36,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 372 transitions. [2023-11-29 05:50:36,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:36,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 372 transitions. [2023-11-29 05:50:36,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 46.5) internal successors, (372), 8 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:36,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:36,088 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:36,088 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 406 flow. Second operand 8 states and 372 transitions. [2023-11-29 05:50:36,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 166 transitions, 987 flow [2023-11-29 05:50:39,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 166 transitions, 987 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:50:39,058 INFO L231 Difference]: Finished difference. Result has 92 places, 105 transitions, 692 flow [2023-11-29 05:50:39,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=692, PETRI_PLACES=92, PETRI_TRANSITIONS=105} [2023-11-29 05:50:39,059 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 18 predicate places. [2023-11-29 05:50:39,059 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 105 transitions, 692 flow [2023-11-29 05:50:39,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:39,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:50:39,060 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] [2023-11-29 05:50:39,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:50:39,060 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:50:39,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:50:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1934329814, now seen corresponding path program 1 times [2023-11-29 05:50:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:50:39,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736195124] [2023-11-29 05:50:39,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:50:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:50:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:50:39,268 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-29 05:50:39,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:50:39,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736195124] [2023-11-29 05:50:39,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736195124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:50:39,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:50:39,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:50:39,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141144087] [2023-11-29 05:50:39,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:50:39,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:50:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:50:39,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:50:39,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:50:39,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 67 [2023-11-29 05:50:39,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 105 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:39,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:50:39,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 67 [2023-11-29 05:50:39,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:50:57,309 INFO L124 PetriNetUnfolderBase]: 103183/148113 cut-off events. [2023-11-29 05:50:57,309 INFO L125 PetriNetUnfolderBase]: For 358914/359170 co-relation queries the response was YES. [2023-11-29 05:50:57,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511764 conditions, 148113 events. 103183/148113 cut-off events. For 358914/359170 co-relation queries the response was YES. Maximal size of possible extension queue 6661. Compared 1210606 event pairs, 21035 based on Foata normal form. 1471/149473 useless extension candidates. Maximal degree in co-relation 511736. Up to 42811 conditions per place. [2023-11-29 05:50:58,463 INFO L140 encePairwiseOnDemand]: 54/67 looper letters, 169 selfloop transitions, 95 changer transitions 15/297 dead transitions. [2023-11-29 05:50:58,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 297 transitions, 2399 flow [2023-11-29 05:50:58,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:50:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 05:50:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 561 transitions. [2023-11-29 05:50:58,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6977611940298507 [2023-11-29 05:50:58,466 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 561 transitions. [2023-11-29 05:50:58,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 561 transitions. [2023-11-29 05:50:58,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:50:58,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 561 transitions. [2023-11-29 05:50:58,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 46.75) internal successors, (561), 12 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:58,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 67.0) internal successors, (871), 13 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:58,471 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 67.0) internal successors, (871), 13 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:50:58,471 INFO L175 Difference]: Start difference. First operand has 92 places, 105 transitions, 692 flow. Second operand 12 states and 561 transitions. [2023-11-29 05:50:58,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 297 transitions, 2399 flow [2023-11-29 05:51:10,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 297 transitions, 2399 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 05:51:10,961 INFO L231 Difference]: Finished difference. Result has 111 places, 160 transitions, 1537 flow [2023-11-29 05:51:10,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1537, PETRI_PLACES=111, PETRI_TRANSITIONS=160} [2023-11-29 05:51:10,962 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 37 predicate places. [2023-11-29 05:51:10,962 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 160 transitions, 1537 flow [2023-11-29 05:51:10,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:51:10,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:10,962 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] [2023-11-29 05:51:10,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:51:10,962 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:51:10,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1777799423, now seen corresponding path program 1 times [2023-11-29 05:51:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:10,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138168935] [2023-11-29 05:51:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:10,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:11,744 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-29 05:51:11,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:11,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138168935] [2023-11-29 05:51:11,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138168935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:11,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:11,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:51:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746747782] [2023-11-29 05:51:11,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:11,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:51:11,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:11,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:51:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:51:12,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-29 05:51:12,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 160 transitions, 1537 flow. Second operand has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:51:12,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:12,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-29 05:51:12,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:27,727 INFO L124 PetriNetUnfolderBase]: 64246/104084 cut-off events. [2023-11-29 05:51:27,727 INFO L125 PetriNetUnfolderBase]: For 402191/411187 co-relation queries the response was YES. [2023-11-29 05:51:28,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375043 conditions, 104084 events. 64246/104084 cut-off events. For 402191/411187 co-relation queries the response was YES. Maximal size of possible extension queue 5825. Compared 1019737 event pairs, 14919 based on Foata normal form. 4632/104826 useless extension candidates. Maximal degree in co-relation 375004. Up to 60949 conditions per place. [2023-11-29 05:51:28,683 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 64 selfloop transitions, 14 changer transitions 66/201 dead transitions. [2023-11-29 05:51:28,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 201 transitions, 1945 flow [2023-11-29 05:51:28,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:51:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:51:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2023-11-29 05:51:28,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6305970149253731 [2023-11-29 05:51:28,685 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 338 transitions. [2023-11-29 05:51:28,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 338 transitions. [2023-11-29 05:51:28,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:28,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 338 transitions. [2023-11-29 05:51:28,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:51:28,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:51:28,688 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:51:28,688 INFO L175 Difference]: Start difference. First operand has 111 places, 160 transitions, 1537 flow. Second operand 8 states and 338 transitions. [2023-11-29 05:51:28,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 201 transitions, 1945 flow [2023-11-29 05:51:44,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 201 transitions, 1902 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-11-29 05:51:44,154 INFO L231 Difference]: Finished difference. Result has 116 places, 99 transitions, 802 flow [2023-11-29 05:51:44,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=802, PETRI_PLACES=116, PETRI_TRANSITIONS=99} [2023-11-29 05:51:44,155 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 42 predicate places. [2023-11-29 05:51:44,155 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 99 transitions, 802 flow [2023-11-29 05:51:44,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:51:44,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:51:44,156 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] [2023-11-29 05:51:44,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:51:44,156 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:51:44,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:51:44,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1219182955, now seen corresponding path program 1 times [2023-11-29 05:51:44,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:51:44,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86343026] [2023-11-29 05:51:44,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:51:44,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:51:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:51:44,388 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-29 05:51:44,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:51:44,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86343026] [2023-11-29 05:51:44,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86343026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:51:44,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:51:44,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:51:44,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527857477] [2023-11-29 05:51:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:51:44,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:51:44,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:51:44,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:51:44,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:51:44,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 67 [2023-11-29 05:51:44,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 99 transitions, 802 flow. Second operand has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:51:44,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:51:44,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 67 [2023-11-29 05:51:44,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:51:55,330 INFO L124 PetriNetUnfolderBase]: 59274/87279 cut-off events. [2023-11-29 05:51:55,330 INFO L125 PetriNetUnfolderBase]: For 283592/284537 co-relation queries the response was YES. [2023-11-29 05:51:55,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319629 conditions, 87279 events. 59274/87279 cut-off events. For 283592/284537 co-relation queries the response was YES. Maximal size of possible extension queue 3708. Compared 701242 event pairs, 10966 based on Foata normal form. 730/87843 useless extension candidates. Maximal degree in co-relation 319590. Up to 34025 conditions per place. [2023-11-29 05:51:56,037 INFO L140 encePairwiseOnDemand]: 54/67 looper letters, 69 selfloop transitions, 14 changer transitions 179/279 dead transitions. [2023-11-29 05:51:56,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 279 transitions, 2468 flow [2023-11-29 05:51:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:51:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 05:51:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 545 transitions. [2023-11-29 05:51:56,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.677860696517413 [2023-11-29 05:51:56,039 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 545 transitions. [2023-11-29 05:51:56,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 545 transitions. [2023-11-29 05:51:56,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:51:56,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 545 transitions. [2023-11-29 05:51:56,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 45.416666666666664) internal successors, (545), 12 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:51:56,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 67.0) internal successors, (871), 13 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:51:56,043 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 67.0) internal successors, (871), 13 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:51:56,043 INFO L175 Difference]: Start difference. First operand has 116 places, 99 transitions, 802 flow. Second operand 12 states and 545 transitions. [2023-11-29 05:51:56,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 279 transitions, 2468 flow [2023-11-29 05:52:02,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 279 transitions, 2328 flow, removed 11 selfloop flow, removed 13 redundant places. [2023-11-29 05:52:02,824 INFO L231 Difference]: Finished difference. Result has 120 places, 70 transitions, 534 flow [2023-11-29 05:52:02,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=534, PETRI_PLACES=120, PETRI_TRANSITIONS=70} [2023-11-29 05:52:02,825 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 46 predicate places. [2023-11-29 05:52:02,825 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 70 transitions, 534 flow [2023-11-29 05:52:02,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:02,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:52:02,826 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-29 05:52:02,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:52:02,826 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:52:02,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:52:02,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1883648186, now seen corresponding path program 1 times [2023-11-29 05:52:02,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:52:02,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099192238] [2023-11-29 05:52:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:52:02,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:52:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:02,950 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-29 05:52:02,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:52:02,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099192238] [2023-11-29 05:52:02,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099192238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:52:02,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:52:02,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:52:02,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837107062] [2023-11-29 05:52:02,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:52:02,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:52:02,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:52:02,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:52:02,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:52:02,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 05:52:02,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 70 transitions, 534 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:02,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:52:02,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 05:52:02,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:52:13,315 INFO L124 PetriNetUnfolderBase]: 59633/89953 cut-off events. [2023-11-29 05:52:13,315 INFO L125 PetriNetUnfolderBase]: For 169126/176361 co-relation queries the response was YES. [2023-11-29 05:52:13,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245767 conditions, 89953 events. 59633/89953 cut-off events. For 169126/176361 co-relation queries the response was YES. Maximal size of possible extension queue 2994. Compared 723684 event pairs, 9830 based on Foata normal form. 3927/91671 useless extension candidates. Maximal degree in co-relation 245737. Up to 48181 conditions per place. [2023-11-29 05:52:14,261 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 63 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2023-11-29 05:52:14,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 826 flow [2023-11-29 05:52:14,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:52:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:52:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2023-11-29 05:52:14,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7238805970149254 [2023-11-29 05:52:14,263 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 194 transitions. [2023-11-29 05:52:14,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 194 transitions. [2023-11-29 05:52:14,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:52:14,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 194 transitions. [2023-11-29 05:52:14,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:14,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:14,265 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:14,265 INFO L175 Difference]: Start difference. First operand has 120 places, 70 transitions, 534 flow. Second operand 4 states and 194 transitions. [2023-11-29 05:52:14,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 826 flow [2023-11-29 05:52:19,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 107 transitions, 682 flow, removed 29 selfloop flow, removed 19 redundant places. [2023-11-29 05:52:19,376 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 455 flow [2023-11-29 05:52:19,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=455, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2023-11-29 05:52:19,377 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2023-11-29 05:52:19,377 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 455 flow [2023-11-29 05:52:19,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:19,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:52:19,378 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-29 05:52:19,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:52:19,378 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:52:19,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:52:19,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1665095052, now seen corresponding path program 1 times [2023-11-29 05:52:19,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:52:19,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103111327] [2023-11-29 05:52:19,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:52:19,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:52:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:19,542 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-29 05:52:19,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:52:19,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103111327] [2023-11-29 05:52:19,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103111327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:52:19,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:52:19,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:52:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948732670] [2023-11-29 05:52:19,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:52:19,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:52:19,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:52:19,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:52:19,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:52:19,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-29 05:52:19,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 455 flow. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:19,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:52:19,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-29 05:52:19,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:52:22,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, 29#L879true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 12#L811true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:22,667 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 05:52:22,667 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:52:22,667 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:52:22,667 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:52:22,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 38#L881true, 34#L808true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:22,668 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 05:52:22,668 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:52:22,668 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:52:22,668 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:52:22,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 39#L883true, Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:22,670 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 05:52:22,670 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:52:22,670 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:52:22,670 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 05:52:23,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 39#L883true, Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:23,499 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,499 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,500 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,500 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 38#L881true, 12#L811true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:23,532 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,532 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,532 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,532 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 39#L883true, Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:23,533 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,533 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,533 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,533 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 1) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][89], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 51#L892true, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 53#L831true, Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:23,534 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,534 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,534 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,534 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 23#L847true, 9#L889true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:23,535 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,535 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,535 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:23,535 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 05:52:24,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 39#L883true, Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, 249#true, 212#true]) [2023-11-29 05:52:24,172 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,172 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,172 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,172 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 1) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][89], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 51#L892true, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 53#L831true, Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:24,183 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,183 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,183 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,183 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 9#L889true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:24,183 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,183 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,183 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,183 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, 29#L879true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 12#L811true, 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:24,222 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,223 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,223 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,223 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 38#L881true, 34#L808true, 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:24,223 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,223 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,223 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,223 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 39#L883true, Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:24,225 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,225 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,225 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,225 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,225 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 39#L883true, Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:24,225 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,225 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,226 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,226 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,226 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 1) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][89], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 51#L892true, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 53#L831true, Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:24,227 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,227 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,227 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,227 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 23#L847true, 9#L889true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:24,227 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,227 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,227 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:24,227 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 05:52:25,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 9#L889true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, 249#true, 212#true]) [2023-11-29 05:52:25,099 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,100 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,100 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,100 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 1) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][89], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 240#true, Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 51#L892true, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 53#L831true, Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, 249#true, 212#true]) [2023-11-29 05:52:25,100 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,100 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,101 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,101 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 39#L883true, Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:25,110 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,110 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,110 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,110 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 38#L881true, 12#L811true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, 249#true, 212#true]) [2023-11-29 05:52:25,162 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,162 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,162 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,162 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 39#L883true, Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:25,163 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,163 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,163 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,163 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 1) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][89], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 51#L892true, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 53#L831true, Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:25,164 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,164 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,164 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,164 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 23#L847true, 9#L889true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:25,164 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,165 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,165 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,165 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,166 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([390] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 1) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][89], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 51#L892true, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 53#L831true, Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:25,166 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,166 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,166 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,166 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,166 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,167 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 9#L889true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 70#L795true, Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:25,167 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,167 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,167 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,167 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:25,167 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 05:52:26,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 39#L883true, Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, 249#true, 212#true]) [2023-11-29 05:52:26,037 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,038 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,038 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,038 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 1) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][89], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 51#L892true, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 53#L831true, Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:26,087 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,087 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,087 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,087 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,088 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 9#L889true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 34#L808true, Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:26,088 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,088 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,088 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,088 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,169 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 39#L883true, Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, 12#L811true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:26,169 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,169 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,169 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,169 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,169 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,170 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 1) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][89], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 51#L892true, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 53#L831true, Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, 249#true, 212#true]) [2023-11-29 05:52:26,170 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,171 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,171 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,171 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 58#L778true, 23#L847true, 9#L889true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 12#L811true, 28#P1EXITtrue, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:26,172 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,172 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,172 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,172 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 05:52:26,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 9#L889true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, 12#L811true, 249#true, 212#true]) [2023-11-29 05:52:26,989 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 05:52:26,989 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:26,989 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:26,989 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:26,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([390] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 1) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][89], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 240#true, Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 51#L892true, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 53#L831true, Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, 12#L811true, 249#true, 212#true]) [2023-11-29 05:52:26,990 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 05:52:26,990 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:26,990 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:26,990 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:27,084 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([390] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 1) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_3 0) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][89], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 51#L892true, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 53#L831true, Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, 12#L811true, 249#true, 212#true]) [2023-11-29 05:52:27,084 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 05:52:27,084 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:27,084 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:27,084 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:27,084 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:27,085 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_68 256) 0))) (let ((.cse6 (not .cse5)) (.cse2 (and (= (mod v_~a$w_buff1_used~0_127 256) 0) .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse3 (and .cse9 .cse5))) (let ((.cse7 (or .cse2 .cse12 .cse3)) (.cse8 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_126 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse7 v_~a~0_73 (ite .cse8 v_~a$w_buff0~0_53 v_~a$w_buff1~0_44)))) (and (= v_~a$w_buff1_used~0_126 (ite .cse0 v_~a$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_127 0))) (= v_~a$w_buff0~0_53 v_~a$w_buff0~0_52) (= v_~a$r_buff0_thd4~0_67 (ite .cse0 v_~a$r_buff0_thd4~0_68 (ite (or .cse1 (and .cse4 .cse5) .cse3) v_~a$r_buff0_thd4~0_68 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_68)))) (= (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse7 v_~a$w_buff0_used~0_138 (ite .cse8 0 v_~a$w_buff0_used~0_138))) v_~a$w_buff0_used~0_137) (= v_~a$w_buff1~0_44 v_~a$w_buff1~0_43) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_67 256) 0))) (or .cse1 (and .cse9 .cse10) (and .cse4 .cse10))) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= v_~a$flush_delayed~0_33 0) (= v_~__unbuffered_p3_EBX~0_18 .cse11) (= v_~a~0_73 v_~a$mem_tmp~0_20) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_20 .cse11))))))) InVars {~a~0=v_~a~0_73, ~a$w_buff1~0=v_~a$w_buff1~0_44, ~a$w_buff0~0=v_~a$w_buff0~0_53, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_127, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_68} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_67, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_43, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_52, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_126, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][64], [Black: 128#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= ~__unbuffered_p2_EAX~0 0)), 240#true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(= ~x~0 0), P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 136#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 140#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 142#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 23#L847true, 9#L889true, 172#true, Black: 161#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 214#(= ~__unbuffered_p2_EAX~0 0), Black: 225#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 215#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 52#P0EXITtrue, 125#(and (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 243#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 28#P1EXITtrue, 12#L811true, Black: 245#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 249#true, 212#true]) [2023-11-29 05:52:27,085 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-29 05:52:27,085 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:27,085 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:27,085 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:27,085 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-29 05:52:30,642 INFO L124 PetriNetUnfolderBase]: 60331/94576 cut-off events. [2023-11-29 05:52:30,642 INFO L125 PetriNetUnfolderBase]: For 113909/121272 co-relation queries the response was YES. [2023-11-29 05:52:31,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263317 conditions, 94576 events. 60331/94576 cut-off events. For 113909/121272 co-relation queries the response was YES. Maximal size of possible extension queue 4475. Compared 861061 event pairs, 29118 based on Foata normal form. 1839/88287 useless extension candidates. Maximal degree in co-relation 263298. Up to 37122 conditions per place. [2023-11-29 05:52:31,497 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 87 selfloop transitions, 13 changer transitions 0/137 dead transitions. [2023-11-29 05:52:31,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 137 transitions, 864 flow [2023-11-29 05:52:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:52:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:52:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 328 transitions. [2023-11-29 05:52:31,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6993603411513859 [2023-11-29 05:52:31,499 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 328 transitions. [2023-11-29 05:52:31,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 328 transitions. [2023-11-29 05:52:31,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:52:31,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 328 transitions. [2023-11-29 05:52:31,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.857142857142854) internal successors, (328), 7 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:31,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:31,503 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:31,503 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 455 flow. Second operand 7 states and 328 transitions. [2023-11-29 05:52:31,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 137 transitions, 864 flow [2023-11-29 05:52:33,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 137 transitions, 856 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 05:52:33,177 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 543 flow [2023-11-29 05:52:33,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=543, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2023-11-29 05:52:33,178 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2023-11-29 05:52:33,178 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 543 flow [2023-11-29 05:52:33,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:33,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:52:33,178 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-29 05:52:33,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:52:33,178 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:52:33,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:52:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 996794013, now seen corresponding path program 1 times [2023-11-29 05:52:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:52:33,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791821040] [2023-11-29 05:52:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:52:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:52:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:33,354 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-29 05:52:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:52:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791821040] [2023-11-29 05:52:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791821040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:52:33,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:52:33,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:52:33,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765647437] [2023-11-29 05:52:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:52:33,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:52:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:52:33,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:52:33,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:52:33,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 05:52:33,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 543 flow. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:33,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:52:33,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 05:52:33,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:52:44,534 INFO L124 PetriNetUnfolderBase]: 67337/101625 cut-off events. [2023-11-29 05:52:44,534 INFO L125 PetriNetUnfolderBase]: For 112981/118585 co-relation queries the response was YES. [2023-11-29 05:52:45,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281443 conditions, 101625 events. 67337/101625 cut-off events. For 112981/118585 co-relation queries the response was YES. Maximal size of possible extension queue 3640. Compared 824512 event pairs, 8712 based on Foata normal form. 4725/103578 useless extension candidates. Maximal degree in co-relation 281421. Up to 38421 conditions per place. [2023-11-29 05:52:45,331 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 80 selfloop transitions, 10 changer transitions 5/135 dead transitions. [2023-11-29 05:52:45,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 135 transitions, 949 flow [2023-11-29 05:52:45,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:52:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:52:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2023-11-29 05:52:45,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2023-11-29 05:52:45,333 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2023-11-29 05:52:45,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2023-11-29 05:52:45,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:52:45,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2023-11-29 05:52:45,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:45,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:45,336 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:45,336 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 543 flow. Second operand 5 states and 247 transitions. [2023-11-29 05:52:45,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 135 transitions, 949 flow [2023-11-29 05:52:46,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 135 transitions, 929 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-29 05:52:46,620 INFO L231 Difference]: Finished difference. Result has 96 places, 82 transitions, 562 flow [2023-11-29 05:52:46,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=562, PETRI_PLACES=96, PETRI_TRANSITIONS=82} [2023-11-29 05:52:46,620 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 22 predicate places. [2023-11-29 05:52:46,620 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 82 transitions, 562 flow [2023-11-29 05:52:46,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:46,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:52:46,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:52:46,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:52:46,621 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:52:46,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:52:46,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2021577715, now seen corresponding path program 1 times [2023-11-29 05:52:46,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:52:46,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381536037] [2023-11-29 05:52:46,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:52:46,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:52:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:52:46,817 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-29 05:52:46,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:52:46,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381536037] [2023-11-29 05:52:46,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381536037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:52:46,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:52:46,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:52:46,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319958882] [2023-11-29 05:52:46,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:52:46,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:52:46,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:52:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:52:46,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:52:46,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-29 05:52:46,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 82 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:52:46,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:52:46,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-29 05:52:46,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:53:01,147 INFO L124 PetriNetUnfolderBase]: 71545/118498 cut-off events. [2023-11-29 05:53:01,147 INFO L125 PetriNetUnfolderBase]: For 171217/200904 co-relation queries the response was YES. [2023-11-29 05:53:01,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349291 conditions, 118498 events. 71545/118498 cut-off events. For 171217/200904 co-relation queries the response was YES. Maximal size of possible extension queue 6090. Compared 1179490 event pairs, 17131 based on Foata normal form. 2595/113312 useless extension candidates. Maximal degree in co-relation 349267. Up to 44667 conditions per place. [2023-11-29 05:53:02,225 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 72 selfloop transitions, 6 changer transitions 9/137 dead transitions. [2023-11-29 05:53:02,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 137 transitions, 968 flow [2023-11-29 05:53:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:53:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:53:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 279 transitions. [2023-11-29 05:53:02,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6940298507462687 [2023-11-29 05:53:02,227 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 279 transitions. [2023-11-29 05:53:02,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 279 transitions. [2023-11-29 05:53:02,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:53:02,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 279 transitions. [2023-11-29 05:53:02,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:02,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:02,229 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:02,229 INFO L175 Difference]: Start difference. First operand has 96 places, 82 transitions, 562 flow. Second operand 6 states and 279 transitions. [2023-11-29 05:53:02,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 137 transitions, 968 flow [2023-11-29 05:53:04,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 137 transitions, 945 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-29 05:53:04,936 INFO L231 Difference]: Finished difference. Result has 99 places, 87 transitions, 633 flow [2023-11-29 05:53:04,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=633, PETRI_PLACES=99, PETRI_TRANSITIONS=87} [2023-11-29 05:53:04,936 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 25 predicate places. [2023-11-29 05:53:04,936 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 87 transitions, 633 flow [2023-11-29 05:53:04,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:04,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:53:04,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:04,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:53:04,937 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:53:04,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:04,937 INFO L85 PathProgramCache]: Analyzing trace with hash 119373125, now seen corresponding path program 2 times [2023-11-29 05:53:04,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:04,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686983949] [2023-11-29 05:53:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:04,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:05,149 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-29 05:53:05,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:05,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686983949] [2023-11-29 05:53:05,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686983949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:53:05,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:53:05,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:53:05,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511708166] [2023-11-29 05:53:05,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:53:05,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:53:05,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:53:05,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:53:05,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 05:53:05,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 87 transitions, 633 flow. Second operand has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:05,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:53:05,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 05:53:05,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:53:20,006 INFO L124 PetriNetUnfolderBase]: 84584/125912 cut-off events. [2023-11-29 05:53:20,006 INFO L125 PetriNetUnfolderBase]: For 167982/178546 co-relation queries the response was YES. [2023-11-29 05:53:20,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370395 conditions, 125912 events. 84584/125912 cut-off events. For 167982/178546 co-relation queries the response was YES. Maximal size of possible extension queue 5420. Compared 1038066 event pairs, 8425 based on Foata normal form. 4717/126709 useless extension candidates. Maximal degree in co-relation 370369. Up to 42480 conditions per place. [2023-11-29 05:53:21,135 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 93 selfloop transitions, 14 changer transitions 6/155 dead transitions. [2023-11-29 05:53:21,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 155 transitions, 1129 flow [2023-11-29 05:53:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:53:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:53:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 298 transitions. [2023-11-29 05:53:21,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 05:53:21,137 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 298 transitions. [2023-11-29 05:53:21,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 298 transitions. [2023-11-29 05:53:21,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:53:21,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 298 transitions. [2023-11-29 05:53:21,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:21,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:21,140 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:21,141 INFO L175 Difference]: Start difference. First operand has 99 places, 87 transitions, 633 flow. Second operand 6 states and 298 transitions. [2023-11-29 05:53:21,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 155 transitions, 1129 flow [2023-11-29 05:53:21,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 155 transitions, 1114 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-29 05:53:21,857 INFO L231 Difference]: Finished difference. Result has 104 places, 89 transitions, 663 flow [2023-11-29 05:53:21,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=104, PETRI_TRANSITIONS=89} [2023-11-29 05:53:21,857 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 30 predicate places. [2023-11-29 05:53:21,857 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 89 transitions, 663 flow [2023-11-29 05:53:21,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:21,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:53:21,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:21,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:53:21,858 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:53:21,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1327310754, now seen corresponding path program 1 times [2023-11-29 05:53:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136248722] [2023-11-29 05:53:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:21,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:22,057 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-29 05:53:22,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:22,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136248722] [2023-11-29 05:53:22,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136248722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:53:22,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:53:22,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:53:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105122551] [2023-11-29 05:53:22,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:53:22,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:53:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:22,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:53:22,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:53:22,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 05:53:22,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 89 transitions, 663 flow. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:22,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:53:22,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 05:53:22,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:53:36,036 INFO L124 PetriNetUnfolderBase]: 76640/112960 cut-off events. [2023-11-29 05:53:36,037 INFO L125 PetriNetUnfolderBase]: For 242769/252901 co-relation queries the response was YES. [2023-11-29 05:53:36,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368504 conditions, 112960 events. 76640/112960 cut-off events. For 242769/252901 co-relation queries the response was YES. Maximal size of possible extension queue 5411. Compared 920922 event pairs, 8249 based on Foata normal form. 2017/111057 useless extension candidates. Maximal degree in co-relation 368477. Up to 42480 conditions per place. [2023-11-29 05:53:37,101 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 81 selfloop transitions, 18 changer transitions 10/145 dead transitions. [2023-11-29 05:53:37,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 145 transitions, 1063 flow [2023-11-29 05:53:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:53:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:53:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 327 transitions. [2023-11-29 05:53:37,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.697228144989339 [2023-11-29 05:53:37,103 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 327 transitions. [2023-11-29 05:53:37,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 327 transitions. [2023-11-29 05:53:37,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:53:37,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 327 transitions. [2023-11-29 05:53:37,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:37,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:37,105 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:37,105 INFO L175 Difference]: Start difference. First operand has 104 places, 89 transitions, 663 flow. Second operand 7 states and 327 transitions. [2023-11-29 05:53:37,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 145 transitions, 1063 flow [2023-11-29 05:53:51,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 145 transitions, 999 flow, removed 18 selfloop flow, removed 8 redundant places. [2023-11-29 05:53:51,130 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 582 flow [2023-11-29 05:53:51,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=582, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2023-11-29 05:53:51,130 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 27 predicate places. [2023-11-29 05:53:51,130 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 582 flow [2023-11-29 05:53:51,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:51,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:53:51,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:51,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:53:51,132 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:53:51,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:51,132 INFO L85 PathProgramCache]: Analyzing trace with hash -25528767, now seen corresponding path program 1 times [2023-11-29 05:53:51,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:51,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904674013] [2023-11-29 05:53:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:51,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:51,909 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-29 05:53:51,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:51,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904674013] [2023-11-29 05:53:51,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904674013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:53:51,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:53:51,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:53:51,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618809645] [2023-11-29 05:53:51,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:53:51,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:53:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:51,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:53:51,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:53:51,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:53:51,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 582 flow. Second operand has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:51,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:53:51,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:53:51,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:53:57,211 INFO L124 PetriNetUnfolderBase]: 22875/40327 cut-off events. [2023-11-29 05:53:57,212 INFO L125 PetriNetUnfolderBase]: For 84941/95651 co-relation queries the response was YES. [2023-11-29 05:53:57,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119310 conditions, 40327 events. 22875/40327 cut-off events. For 84941/95651 co-relation queries the response was YES. Maximal size of possible extension queue 3088. Compared 399279 event pairs, 4827 based on Foata normal form. 544/36441 useless extension candidates. Maximal degree in co-relation 119286. Up to 11868 conditions per place. [2023-11-29 05:53:57,575 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 60 selfloop transitions, 6 changer transitions 16/138 dead transitions. [2023-11-29 05:53:57,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 138 transitions, 929 flow [2023-11-29 05:53:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:53:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:53:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 402 transitions. [2023-11-29 05:53:57,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 05:53:57,577 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 402 transitions. [2023-11-29 05:53:57,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 402 transitions. [2023-11-29 05:53:57,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:53:57,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 402 transitions. [2023-11-29 05:53:57,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.666666666666664) internal successors, (402), 9 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:57,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:57,580 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:57,580 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 582 flow. Second operand 9 states and 402 transitions. [2023-11-29 05:53:57,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 138 transitions, 929 flow [2023-11-29 05:53:59,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 138 transitions, 811 flow, removed 38 selfloop flow, removed 9 redundant places. [2023-11-29 05:53:59,638 INFO L231 Difference]: Finished difference. Result has 103 places, 84 transitions, 519 flow [2023-11-29 05:53:59,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=519, PETRI_PLACES=103, PETRI_TRANSITIONS=84} [2023-11-29 05:53:59,638 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 29 predicate places. [2023-11-29 05:53:59,638 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 84 transitions, 519 flow [2023-11-29 05:53:59,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:59,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:53:59,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:53:59,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:53:59,639 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:53:59,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:53:59,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1888544659, now seen corresponding path program 2 times [2023-11-29 05:53:59,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:53:59,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37303837] [2023-11-29 05:53:59,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:53:59,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:53:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:53:59,903 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-29 05:53:59,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:53:59,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37303837] [2023-11-29 05:53:59,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37303837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:53:59,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:53:59,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:53:59,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156074481] [2023-11-29 05:53:59,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:53:59,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:53:59,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:53:59,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:53:59,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:53:59,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-29 05:53:59,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 84 transitions, 519 flow. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:53:59,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:53:59,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-29 05:53:59,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:07,788 INFO L124 PetriNetUnfolderBase]: 39359/69775 cut-off events. [2023-11-29 05:54:07,788 INFO L125 PetriNetUnfolderBase]: For 103907/111319 co-relation queries the response was YES. [2023-11-29 05:54:08,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191459 conditions, 69775 events. 39359/69775 cut-off events. For 103907/111319 co-relation queries the response was YES. Maximal size of possible extension queue 5382. Compared 742006 event pairs, 11597 based on Foata normal form. 776/63314 useless extension candidates. Maximal degree in co-relation 191436. Up to 26527 conditions per place. [2023-11-29 05:54:08,291 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 35 selfloop transitions, 1 changer transitions 35/124 dead transitions. [2023-11-29 05:54:08,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 124 transitions, 806 flow [2023-11-29 05:54:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:54:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:54:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 268 transitions. [2023-11-29 05:54:08,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 05:54:08,292 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 268 transitions. [2023-11-29 05:54:08,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 268 transitions. [2023-11-29 05:54:08,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:08,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 268 transitions. [2023-11-29 05:54:08,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:08,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:08,294 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:08,294 INFO L175 Difference]: Start difference. First operand has 103 places, 84 transitions, 519 flow. Second operand 6 states and 268 transitions. [2023-11-29 05:54:08,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 124 transitions, 806 flow [2023-11-29 05:54:15,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 124 transitions, 783 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-29 05:54:15,529 INFO L231 Difference]: Finished difference. Result has 103 places, 81 transitions, 489 flow [2023-11-29 05:54:15,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=489, PETRI_PLACES=103, PETRI_TRANSITIONS=81} [2023-11-29 05:54:15,530 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 29 predicate places. [2023-11-29 05:54:15,530 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 81 transitions, 489 flow [2023-11-29 05:54:15,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:15,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:15,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:15,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:54:15,530 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:15,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:15,531 INFO L85 PathProgramCache]: Analyzing trace with hash 127046749, now seen corresponding path program 3 times [2023-11-29 05:54:15,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:54:15,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271365290] [2023-11-29 05:54:15,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:54:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:54:15,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:54:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:54:15,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:54:15,719 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:54:15,720 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:54:15,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:54:15,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:54:15,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:54:15,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:54:15,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:54:15,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:54:15,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:54:15,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:54:15,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:54:15,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:54:15,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:54:15,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:54:15,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:54:15,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:54:15,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:54:15,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:54:15,725 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:15,732 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:54:15,732 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:54:15,806 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:54:15,809 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:54:15,812 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:54:15,814 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:54:15,828 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:54:15,829 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:54:15,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:54:15 BasicIcfg [2023-11-29 05:54:15,844 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:54:15,844 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:54:15,844 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:54:15,845 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:54:15,845 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:50:01" (3/4) ... [2023-11-29 05:54:15,847 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:54:15,848 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:54:15,848 INFO L158 Benchmark]: Toolchain (without parser) took 255956.82ms. Allocated memory was 169.9MB in the beginning and 12.0GB in the end (delta: 11.8GB). Free memory was 130.3MB in the beginning and 9.9GB in the end (delta: -9.7GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2023-11-29 05:54:15,849 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory was 63.2MB in the beginning and 63.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:54:15,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.14ms. Allocated memory is still 169.9MB. Free memory was 129.9MB in the beginning and 105.6MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 05:54:15,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.34ms. Allocated memory is still 169.9MB. Free memory was 105.6MB in the beginning and 103.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:54:15,850 INFO L158 Benchmark]: Boogie Preprocessor took 63.14ms. Allocated memory is still 169.9MB. Free memory was 103.1MB in the beginning and 99.2MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:54:15,850 INFO L158 Benchmark]: RCFGBuilder took 845.60ms. Allocated memory is still 169.9MB. Free memory was 99.2MB in the beginning and 97.1MB in the end (delta: 2.1MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2023-11-29 05:54:15,850 INFO L158 Benchmark]: TraceAbstraction took 254493.46ms. Allocated memory was 169.9MB in the beginning and 12.0GB in the end (delta: 11.8GB). Free memory was 96.8MB in the beginning and 9.9GB in the end (delta: -9.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2023-11-29 05:54:15,850 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 12.0GB. Free memory is still 9.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:54:15,852 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory was 63.2MB in the beginning and 63.0MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.14ms. Allocated memory is still 169.9MB. Free memory was 129.9MB in the beginning and 105.6MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.34ms. Allocated memory is still 169.9MB. Free memory was 105.6MB in the beginning and 103.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.14ms. Allocated memory is still 169.9MB. Free memory was 103.1MB in the beginning and 99.2MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 845.60ms. Allocated memory is still 169.9MB. Free memory was 99.2MB in the beginning and 97.1MB in the end (delta: 2.1MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 254493.46ms. Allocated memory was 169.9MB in the beginning and 12.0GB in the end (delta: 11.8GB). Free memory was 96.8MB in the beginning and 9.9GB in the end (delta: -9.8GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 3.42ms. Allocated memory is still 12.0GB. Free memory is still 9.9GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t121; [L872] FCALL, FORK 0 pthread_create(&t121, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t121={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t122; [L874] FCALL, FORK 0 pthread_create(&t122, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t121={5:0}, t122={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t123; [L876] FCALL, FORK 0 pthread_create(&t123, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t121={5:0}, t122={6:0}, t123={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L877] 0 pthread_t t124; [L878] FCALL, FORK 0 pthread_create(&t124, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix005_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 254.3s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 248.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1767 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1549 mSDsluCounter, 373 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 265 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4682 IncrementalHoareTripleChecker+Invalid, 4771 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 108 mSDtfsCounter, 4682 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1537occurred in iteration=13, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 3456 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 05:54:15,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:54:18,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:54:18,573 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 05:54:18,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:54:18,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:54:18,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:54:18,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:54:18,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:54:18,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:54:18,615 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:54:18,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:54:18,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:54:18,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:54:18,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:54:18,618 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:54:18,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:54:18,620 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:54:18,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:54:18,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:54:18,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:54:18,622 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:54:18,622 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:54:18,623 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:54:18,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:54:18,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:54:18,624 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:54:18,625 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:54:18,625 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:54:18,625 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:54:18,626 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:54:18,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:54:18,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:54:18,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:54:18,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:54:18,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:54:18,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:54:18,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:54:18,628 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:54:18,629 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:54:18,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:54:18,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:54:18,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:54:18,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:54:18,630 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:54:18,630 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_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/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_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 [2023-11-29 05:54:18,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:54:18,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:54:18,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:54:18,959 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:54:18,960 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:54:18,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 05:54:21,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:54:22,100 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:54:22,101 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 05:54:22,117 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/data/9bfd175f2/f163054038a04804b625a933e4e75915/FLAG526e80ef2 [2023-11-29 05:54:22,130 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/data/9bfd175f2/f163054038a04804b625a933e4e75915 [2023-11-29 05:54:22,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:54:22,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:54:22,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:54:22,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:54:22,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:54:22,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4448de4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22, skipping insertion in model container [2023-11-29 05:54:22,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,193 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:54:22,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:54:22,547 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:54:22,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:54:22,639 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:54:22,639 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:54:22,647 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:54:22,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22 WrapperNode [2023-11-29 05:54:22,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:54:22,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:54:22,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:54:22,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:54:22,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,703 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-11-29 05:54:22,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:54:22,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:54:22,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:54:22,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:54:22,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,740 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-29 05:54:22,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:54:22,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:54:22,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:54:22,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:54:22,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (1/1) ... [2023-11-29 05:54:22,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:54:22,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:54:22,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:54:22,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:54:22,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:54:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:54:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:54:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:54:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:54:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:54:22,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:54:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 05:54:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 05:54:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:54:22,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:54:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:54:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 05:54:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 05:54:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:54:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:54:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:54:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:54:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:54:22,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:54:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:54:22,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:54:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:54:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:54:22,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:54:22,846 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:54:23,046 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:54:23,049 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:54:23,458 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:54:23,711 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:54:23,712 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:54:23,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:54:23 BoogieIcfgContainer [2023-11-29 05:54:23,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:54:23,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:54:23,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:54:23,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:54:23,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:54:22" (1/3) ... [2023-11-29 05:54:23,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53df89b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:54:23, skipping insertion in model container [2023-11-29 05:54:23,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:54:22" (2/3) ... [2023-11-29 05:54:23,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53df89b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:54:23, skipping insertion in model container [2023-11-29 05:54:23,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:54:23" (3/3) ... [2023-11-29 05:54:23,722 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 05:54:23,743 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:54:23,744 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:54:23,744 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:54:23,811 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:54:23,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:54:23,888 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 05:54:23,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:54:23,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-29 05:54:23,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 05:54:23,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 05:54:23,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:54:23,916 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45dacb36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:54:23,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:54:23,920 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:54:23,920 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:54:23,920 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:54:23,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:23,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:54:23,922 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:23,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 14461, now seen corresponding path program 1 times [2023-11-29 05:54:23,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:23,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068293490] [2023-11-29 05:54:23,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:23,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:23,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:23,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:23,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:54:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:24,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:54:24,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:24,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:54:24,198 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-29 05:54:24,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:24,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:24,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068293490] [2023-11-29 05:54:24,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068293490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:24,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:24,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:54:24,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060906260] [2023-11-29 05:54:24,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:24,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:24,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:24,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:24,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:24,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:54:24,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:24,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:24,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:54:24,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:25,722 INFO L124 PetriNetUnfolderBase]: 4217/7253 cut-off events. [2023-11-29 05:54:25,722 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 05:54:25,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13180 conditions, 7253 events. 4217/7253 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54704 event pairs, 3179 based on Foata normal form. 360/6961 useless extension candidates. Maximal degree in co-relation 13165. Up to 4391 conditions per place. [2023-11-29 05:54:25,805 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-29 05:54:25,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 228 flow [2023-11-29 05:54:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 05:54:25,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 05:54:25,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 05:54:25,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 05:54:25,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:25,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 05:54:25,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:25,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:25,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:25,834 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 149 transitions. [2023-11-29 05:54:25,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 228 flow [2023-11-29 05:54:25,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:54:25,845 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 05:54:25,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-29 05:54:25,851 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 05:54:25,851 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 05:54:25,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:25,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:25,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:54:25,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:54:26,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:26,053 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:26,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:26,054 INFO L85 PathProgramCache]: Analyzing trace with hash 14462, now seen corresponding path program 1 times [2023-11-29 05:54:26,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:26,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618002582] [2023-11-29 05:54:26,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:26,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:26,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:26,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:26,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:54:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:26,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:54:26,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:26,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:54:26,158 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-29 05:54:26,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:26,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:26,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618002582] [2023-11-29 05:54:26,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618002582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:26,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:26,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:54:26,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606736667] [2023-11-29 05:54:26,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:26,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:26,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:26,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:26,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 05:54:26,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:26,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:26,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 05:54:26,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:27,269 INFO L124 PetriNetUnfolderBase]: 4217/7252 cut-off events. [2023-11-29 05:54:27,270 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 05:54:27,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13356 conditions, 7252 events. 4217/7252 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54813 event pairs, 3179 based on Foata normal form. 1/6601 useless extension candidates. Maximal degree in co-relation 13345. Up to 4390 conditions per place. [2023-11-29 05:54:27,323 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 05:54:27,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 224 flow [2023-11-29 05:54:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 05:54:27,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 05:54:27,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 05:54:27,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 05:54:27,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:27,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 05:54:27,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:27,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:27,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:27,331 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 149 transitions. [2023-11-29 05:54:27,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 224 flow [2023-11-29 05:54:27,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:27,343 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 05:54:27,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 05:54:27,344 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 05:54:27,344 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 05:54:27,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:27,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:27,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:54:27,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 05:54:27,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:27,546 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:27,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:27,546 INFO L85 PathProgramCache]: Analyzing trace with hash 431249003, now seen corresponding path program 1 times [2023-11-29 05:54:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436723779] [2023-11-29 05:54:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:27,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:27,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:27,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:27,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 05:54:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:27,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:54:27,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:27,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:54:27,649 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-29 05:54:27,649 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:27,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:27,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436723779] [2023-11-29 05:54:27,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436723779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:27,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:27,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889630898] [2023-11-29 05:54:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:27,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:27,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:27,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:27,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:27,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:54:27,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:27,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:27,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:54:27,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:28,645 INFO L124 PetriNetUnfolderBase]: 4221/7215 cut-off events. [2023-11-29 05:54:28,645 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 05:54:28,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13328 conditions, 7215 events. 4221/7215 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 54424 event pairs, 3251 based on Foata normal form. 0/6573 useless extension candidates. Maximal degree in co-relation 13317. Up to 4393 conditions per place. [2023-11-29 05:54:28,703 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 05:54:28,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 224 flow [2023-11-29 05:54:28,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2023-11-29 05:54:28,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-29 05:54:28,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 147 transitions. [2023-11-29 05:54:28,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 147 transitions. [2023-11-29 05:54:28,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:28,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 147 transitions. [2023-11-29 05:54:28,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:28,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:28,709 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:28,709 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 147 transitions. [2023-11-29 05:54:28,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 224 flow [2023-11-29 05:54:28,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:28,717 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:54:28,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-29 05:54:28,718 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 05:54:28,718 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:54:28,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:28,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:28,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:54:28,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-29 05:54:28,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:28,920 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:28,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash 431249004, now seen corresponding path program 1 times [2023-11-29 05:54:28,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:28,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918450902] [2023-11-29 05:54:28,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:28,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:28,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:28,922 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:28,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 05:54:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:29,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:54:29,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:29,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:54:29,028 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-29 05:54:29,029 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:29,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:29,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918450902] [2023-11-29 05:54:29,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918450902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:29,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:29,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:29,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40190368] [2023-11-29 05:54:29,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:29,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:29,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:29,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:29,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:29,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 05:54:29,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:29,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:29,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 05:54:29,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:29,829 INFO L124 PetriNetUnfolderBase]: 4217/7242 cut-off events. [2023-11-29 05:54:29,830 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-29 05:54:29,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13350 conditions, 7242 events. 4217/7242 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 55235 event pairs, 2503 based on Foata normal form. 5/6608 useless extension candidates. Maximal degree in co-relation 13340. Up to 4384 conditions per place. [2023-11-29 05:54:29,874 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 05:54:29,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-29 05:54:29,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 05:54:29,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 05:54:29,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 05:54:29,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 05:54:29,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:29,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 05:54:29,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:29,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:29,880 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:29,880 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 149 transitions. [2023-11-29 05:54:29,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-29 05:54:29,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:29,885 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 05:54:29,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-29 05:54:29,886 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 05:54:29,886 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 05:54:29,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:29,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:29,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:54:29,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 05:54:30,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:30,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:30,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:30,089 INFO L85 PathProgramCache]: Analyzing trace with hash 431250626, now seen corresponding path program 1 times [2023-11-29 05:54:30,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:30,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854097180] [2023-11-29 05:54:30,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:30,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:30,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:30,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 05:54:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:30,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:54:30,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:30,181 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-29 05:54:30,181 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:30,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:30,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854097180] [2023-11-29 05:54:30,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854097180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:30,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:30,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:54:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468546717] [2023-11-29 05:54:30,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:30,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:30,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:30,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:30,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 05:54:30,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:30,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:30,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 05:54:30,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:30,742 INFO L124 PetriNetUnfolderBase]: 3311/5479 cut-off events. [2023-11-29 05:54:30,742 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 05:54:30,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10304 conditions, 5479 events. 3311/5479 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39618 event pairs, 593 based on Foata normal form. 0/5397 useless extension candidates. Maximal degree in co-relation 10294. Up to 3661 conditions per place. [2023-11-29 05:54:30,771 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-29 05:54:30,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 262 flow [2023-11-29 05:54:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-29 05:54:30,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7960199004975125 [2023-11-29 05:54:30,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-29 05:54:30,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-29 05:54:30,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:30,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-29 05:54:30,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:30,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:30,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:30,776 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 160 transitions. [2023-11-29 05:54:30,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 262 flow [2023-11-29 05:54:30,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:30,780 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-29 05:54:30,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-29 05:54:30,781 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-29 05:54:30,781 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-29 05:54:30,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:30,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:30,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:30,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 05:54:30,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:30,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:30,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1092312360, now seen corresponding path program 1 times [2023-11-29 05:54:30,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:30,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330716739] [2023-11-29 05:54:30,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:30,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:30,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:30,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:30,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 05:54:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:31,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:54:31,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:31,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:54:31,119 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-29 05:54:31,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:31,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:31,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330716739] [2023-11-29 05:54:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330716739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:31,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:31,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480313374] [2023-11-29 05:54:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:31,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:31,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:31,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:31,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:54:31,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:31,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:31,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:54:31,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:31,831 INFO L124 PetriNetUnfolderBase]: 2920/5185 cut-off events. [2023-11-29 05:54:31,831 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-29 05:54:31,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9621 conditions, 5185 events. 2920/5185 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 38433 event pairs, 1356 based on Foata normal form. 0/4950 useless extension candidates. Maximal degree in co-relation 9610. Up to 3460 conditions per place. [2023-11-29 05:54:31,865 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 05:54:31,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 210 flow [2023-11-29 05:54:31,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:31,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 05:54:31,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 05:54:31,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 05:54:31,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 05:54:31,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:31,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 05:54:31,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:31,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:31,870 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:31,870 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-29 05:54:31,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 210 flow [2023-11-29 05:54:31,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:31,873 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 05:54:31,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-29 05:54:31,874 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 05:54:31,874 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 05:54:31,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:31,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:31,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:31,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 05:54:32,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:32,076 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:32,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:32,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1092312361, now seen corresponding path program 1 times [2023-11-29 05:54:32,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:32,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882328583] [2023-11-29 05:54:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:32,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:32,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:32,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:32,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 05:54:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:32,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:54:32,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:32,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:54:32,175 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-29 05:54:32,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:32,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:32,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882328583] [2023-11-29 05:54:32,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882328583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:32,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:32,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:32,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452619363] [2023-11-29 05:54:32,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:32,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:32,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:32,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:32,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:32,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 05:54:32,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:32,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:32,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 05:54:32,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:32,925 INFO L124 PetriNetUnfolderBase]: 2903/5060 cut-off events. [2023-11-29 05:54:32,925 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:54:32,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9341 conditions, 5060 events. 2903/5060 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 37185 event pairs, 1620 based on Foata normal form. 12/4873 useless extension candidates. Maximal degree in co-relation 9331. Up to 3431 conditions per place. [2023-11-29 05:54:32,962 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 05:54:32,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-29 05:54:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:54:32,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 05:54:32,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:54:32,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:54:32,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:32,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:54:32,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:32,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:32,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:32,967 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:54:32,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-29 05:54:32,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:32,971 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 05:54:32,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-29 05:54:32,972 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 05:54:32,972 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 05:54:32,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:32,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:32,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:32,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 05:54:33,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:33,173 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:33,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1889240966, now seen corresponding path program 1 times [2023-11-29 05:54:33,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:33,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102453224] [2023-11-29 05:54:33,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:33,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:33,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:33,175 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:33,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 05:54:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:33,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:54:33,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:33,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 05:54:33,296 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-29 05:54:33,297 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:33,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:33,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102453224] [2023-11-29 05:54:33,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102453224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:33,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:33,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883448006] [2023-11-29 05:54:33,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:33,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:33,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:33,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:33,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 05:54:33,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:33,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:33,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 05:54:33,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:33,872 INFO L124 PetriNetUnfolderBase]: 2978/5135 cut-off events. [2023-11-29 05:54:33,872 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 05:54:33,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9527 conditions, 5135 events. 2978/5135 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 37072 event pairs, 1424 based on Foata normal form. 0/4968 useless extension candidates. Maximal degree in co-relation 9517. Up to 3426 conditions per place. [2023-11-29 05:54:33,893 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:54:33,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-29 05:54:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 05:54:33,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 05:54:33,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 05:54:33,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 05:54:33,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:33,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 05:54:33,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:33,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:33,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:33,897 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 144 transitions. [2023-11-29 05:54:33,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-29 05:54:33,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:33,899 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 05:54:33,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 05:54:33,899 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 05:54:33,899 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 05:54:33,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:33,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:33,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:33,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 05:54:34,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:34,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:34,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:34,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1889240965, now seen corresponding path program 1 times [2023-11-29 05:54:34,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244608128] [2023-11-29 05:54:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:34,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:34,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:34,102 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:34,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 05:54:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:34,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:54:34,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:34,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:54:34,207 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-29 05:54:34,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:34,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:34,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244608128] [2023-11-29 05:54:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244608128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:34,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:34,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:54:34,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665117852] [2023-11-29 05:54:34,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:34,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:54:34,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:34,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:54:34,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:54:34,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 05:54:34,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:34,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:34,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 05:54:34,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:34,744 INFO L124 PetriNetUnfolderBase]: 2903/5084 cut-off events. [2023-11-29 05:54:34,744 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 05:54:34,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9389 conditions, 5084 events. 2903/5084 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 37064 event pairs, 920 based on Foata normal form. 36/4977 useless extension candidates. Maximal degree in co-relation 9379. Up to 3315 conditions per place. [2023-11-29 05:54:34,772 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:54:34,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-29 05:54:34,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:54:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:54:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:54:34,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 05:54:34,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:54:34,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:54:34,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:34,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:54:34,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:34,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:34,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:34,775 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:54:34,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-29 05:54:34,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:34,777 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 05:54:34,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 05:54:34,778 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-29 05:54:34,778 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 05:54:34,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:34,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:34,778 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] [2023-11-29 05:54:34,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 05:54:34,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:34,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:34,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:34,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1350045054, now seen corresponding path program 1 times [2023-11-29 05:54:34,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:34,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594129469] [2023-11-29 05:54:34,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:34,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:34,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:34,981 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:34,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 05:54:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:35,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:54:35,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:35,150 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-29 05:54:35,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:35,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:35,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594129469] [2023-11-29 05:54:35,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594129469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:35,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:35,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:54:35,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284115039] [2023-11-29 05:54:35,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:35,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:54:35,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:35,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:54:35,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:54:35,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 05:54:35,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:35,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:35,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 05:54:35,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:36,395 INFO L124 PetriNetUnfolderBase]: 9971/15479 cut-off events. [2023-11-29 05:54:36,395 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-29 05:54:36,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29704 conditions, 15479 events. 9971/15479 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 113529 event pairs, 1033 based on Foata normal form. 400/15704 useless extension candidates. Maximal degree in co-relation 29694. Up to 8761 conditions per place. [2023-11-29 05:54:36,472 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 54 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2023-11-29 05:54:36,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 306 flow [2023-11-29 05:54:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:54:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:54:36,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2023-11-29 05:54:36,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7276119402985075 [2023-11-29 05:54:36,474 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 195 transitions. [2023-11-29 05:54:36,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 195 transitions. [2023-11-29 05:54:36,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:36,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 195 transitions. [2023-11-29 05:54:36,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:36,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:36,475 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:36,475 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 4 states and 195 transitions. [2023-11-29 05:54:36,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 306 flow [2023-11-29 05:54:36,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:36,484 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 150 flow [2023-11-29 05:54:36,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-11-29 05:54:36,485 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 05:54:36,485 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 150 flow [2023-11-29 05:54:36,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:36,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:36,486 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] [2023-11-29 05:54:36,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 05:54:36,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:36,686 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:36,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:36,686 INFO L85 PathProgramCache]: Analyzing trace with hash -425909525, now seen corresponding path program 1 times [2023-11-29 05:54:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:36,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037212401] [2023-11-29 05:54:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:36,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:36,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:36,688 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:36,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 05:54:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:36,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:54:36,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:36,841 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-29 05:54:36,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:36,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:36,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037212401] [2023-11-29 05:54:36,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037212401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:36,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:36,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:54:36,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536826709] [2023-11-29 05:54:36,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:36,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:54:36,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:36,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:54:36,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:54:36,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 05:54:36,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:36,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:36,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 05:54:36,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:37,865 INFO L124 PetriNetUnfolderBase]: 7427/11579 cut-off events. [2023-11-29 05:54:37,865 INFO L125 PetriNetUnfolderBase]: For 2580/2580 co-relation queries the response was YES. [2023-11-29 05:54:37,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25507 conditions, 11579 events. 7427/11579 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 80336 event pairs, 451 based on Foata normal form. 364/11792 useless extension candidates. Maximal degree in co-relation 25494. Up to 5521 conditions per place. [2023-11-29 05:54:37,918 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 69 selfloop transitions, 10 changer transitions 1/101 dead transitions. [2023-11-29 05:54:37,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 433 flow [2023-11-29 05:54:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:54:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:54:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2023-11-29 05:54:37,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2023-11-29 05:54:37,920 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2023-11-29 05:54:37,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2023-11-29 05:54:37,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:37,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2023-11-29 05:54:37,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:37,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:37,923 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:37,923 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 150 flow. Second operand 5 states and 247 transitions. [2023-11-29 05:54:37,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 433 flow [2023-11-29 05:54:37,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:54:37,926 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 202 flow [2023-11-29 05:54:37,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-11-29 05:54:37,927 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 05:54:37,927 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 202 flow [2023-11-29 05:54:37,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:37,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:37,927 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-29 05:54:37,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 05:54:38,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:38,128 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:38,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1896261015, now seen corresponding path program 1 times [2023-11-29 05:54:38,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:38,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458661871] [2023-11-29 05:54:38,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:38,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:38,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:38,129 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:38,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 05:54:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:38,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:54:38,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:38,292 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-29 05:54:38,292 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:38,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:38,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458661871] [2023-11-29 05:54:38,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458661871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:38,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:38,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:54:38,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730909092] [2023-11-29 05:54:38,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:38,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:54:38,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:38,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:54:38,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:54:38,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 05:54:38,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:38,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:38,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 05:54:38,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:39,120 INFO L124 PetriNetUnfolderBase]: 4491/6895 cut-off events. [2023-11-29 05:54:39,120 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2023-11-29 05:54:39,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17129 conditions, 6895 events. 4491/6895 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 41432 event pairs, 289 based on Foata normal form. 244/7005 useless extension candidates. Maximal degree in co-relation 17114. Up to 1969 conditions per place. [2023-11-29 05:54:39,155 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 82 selfloop transitions, 14 changer transitions 1/118 dead transitions. [2023-11-29 05:54:39,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 118 transitions, 564 flow [2023-11-29 05:54:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:54:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:54:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 297 transitions. [2023-11-29 05:54:39,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7388059701492538 [2023-11-29 05:54:39,157 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 297 transitions. [2023-11-29 05:54:39,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 297 transitions. [2023-11-29 05:54:39,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:39,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 297 transitions. [2023-11-29 05:54:39,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:39,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:39,160 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:39,160 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 202 flow. Second operand 6 states and 297 transitions. [2023-11-29 05:54:39,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 118 transitions, 564 flow [2023-11-29 05:54:39,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 118 transitions, 534 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 05:54:39,178 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 252 flow [2023-11-29 05:54:39,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-29 05:54:39,179 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-29 05:54:39,179 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 252 flow [2023-11-29 05:54:39,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:39,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:39,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:39,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 05:54:39,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:39,380 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:39,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:39,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1623881974, now seen corresponding path program 1 times [2023-11-29 05:54:39,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:39,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366175766] [2023-11-29 05:54:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:39,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:39,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:39,383 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:39,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 05:54:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:39,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:54:39,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:39,599 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-29 05:54:39,599 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:39,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:39,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366175766] [2023-11-29 05:54:39,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366175766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:39,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:39,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:54:39,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101172914] [2023-11-29 05:54:39,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:39,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:54:39,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:39,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:54:39,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:54:39,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 05:54:39,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:39,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:39,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 05:54:39,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:40,385 INFO L124 PetriNetUnfolderBase]: 2927/4303 cut-off events. [2023-11-29 05:54:40,385 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2023-11-29 05:54:40,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11826 conditions, 4303 events. 2927/4303 cut-off events. For 4826/4826 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 22812 event pairs, 231 based on Foata normal form. 96/4265 useless extension candidates. Maximal degree in co-relation 11810. Up to 1316 conditions per place. [2023-11-29 05:54:40,404 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 73 selfloop transitions, 18 changer transitions 1/113 dead transitions. [2023-11-29 05:54:40,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 554 flow [2023-11-29 05:54:40,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:54:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:54:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 325 transitions. [2023-11-29 05:54:40,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6929637526652452 [2023-11-29 05:54:40,407 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 325 transitions. [2023-11-29 05:54:40,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 325 transitions. [2023-11-29 05:54:40,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:40,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 325 transitions. [2023-11-29 05:54:40,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:40,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:40,409 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:40,409 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 252 flow. Second operand 7 states and 325 transitions. [2023-11-29 05:54:40,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 554 flow [2023-11-29 05:54:40,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 508 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 05:54:40,434 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 262 flow [2023-11-29 05:54:40,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2023-11-29 05:54:40,434 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-29 05:54:40,435 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 262 flow [2023-11-29 05:54:40,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:40,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:40,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:40,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 05:54:40,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:40,635 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:40,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:40,636 INFO L85 PathProgramCache]: Analyzing trace with hash 293004401, now seen corresponding path program 1 times [2023-11-29 05:54:40,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:40,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108338510] [2023-11-29 05:54:40,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:40,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:40,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:40,637 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:40,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 05:54:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:40,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:54:40,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:41,688 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t121~0#1.base_69| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t124~0#1.base_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t123~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t122~0#1.base_65| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t121~0#1.base_69| (_ bv1 1)))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t122~0#1.base_65| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t123~0#1.base_57|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t121~0#1.base_69|) (_ bv0 1)) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t121~0#1.base_69| (_ bv0 1)) |v_ULTIMATE.start_main_~#t122~0#1.base_65| (_ bv0 1)) |v_ULTIMATE.start_main_~#t123~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t124~0#1.base_43| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~#t122~0#1.base_65|)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t123~0#1.base_57| (_ bv1 1)) |v_ULTIMATE.start_main_~#t124~0#1.base_43|)))))) is different from true [2023-11-29 05:54:41,690 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-29 05:54:41,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:41,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:41,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108338510] [2023-11-29 05:54:41,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108338510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:41,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:41,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:54:41,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241481752] [2023-11-29 05:54:41,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:41,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:54:41,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:41,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:54:41,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-29 05:54:41,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 67 [2023-11-29 05:54:41,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:41,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:41,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 67 [2023-11-29 05:54:41,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:42,483 INFO L124 PetriNetUnfolderBase]: 1597/2820 cut-off events. [2023-11-29 05:54:42,483 INFO L125 PetriNetUnfolderBase]: For 1155/1243 co-relation queries the response was YES. [2023-11-29 05:54:42,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6354 conditions, 2820 events. 1597/2820 cut-off events. For 1155/1243 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17384 event pairs, 559 based on Foata normal form. 16/2649 useless extension candidates. Maximal degree in co-relation 6336. Up to 1876 conditions per place. [2023-11-29 05:54:42,503 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 43 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2023-11-29 05:54:42,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 412 flow [2023-11-29 05:54:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:54:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:54:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2023-11-29 05:54:42,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861407249466951 [2023-11-29 05:54:42,505 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 228 transitions. [2023-11-29 05:54:42,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 228 transitions. [2023-11-29 05:54:42,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:42,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 228 transitions. [2023-11-29 05:54:42,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:42,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:42,507 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:42,508 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 262 flow. Second operand 7 states and 228 transitions. [2023-11-29 05:54:42,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 412 flow [2023-11-29 05:54:42,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 316 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 05:54:42,516 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 207 flow [2023-11-29 05:54:42,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2023-11-29 05:54:42,517 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-29 05:54:42,517 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 207 flow [2023-11-29 05:54:42,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:42,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:42,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:42,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 05:54:42,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:42,718 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:42,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash 703050563, now seen corresponding path program 1 times [2023-11-29 05:54:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:42,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328237139] [2023-11-29 05:54:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:54:42,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:42,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:42,719 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:42,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 05:54:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:54:42,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 05:54:42,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:43,568 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-29 05:54:43,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:43,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:43,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328237139] [2023-11-29 05:54:43,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328237139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:43,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:43,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:54:43,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137647376] [2023-11-29 05:54:43,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:43,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:54:43,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:43,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:54:43,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:54:43,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 05:54:43,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 207 flow. Second operand has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:43,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:43,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 05:54:43,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:44,346 INFO L124 PetriNetUnfolderBase]: 2271/3804 cut-off events. [2023-11-29 05:54:44,346 INFO L125 PetriNetUnfolderBase]: For 1167/1391 co-relation queries the response was YES. [2023-11-29 05:54:44,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9115 conditions, 3804 events. 2271/3804 cut-off events. For 1167/1391 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 23588 event pairs, 439 based on Foata normal form. 16/3584 useless extension candidates. Maximal degree in co-relation 9102. Up to 1499 conditions per place. [2023-11-29 05:54:44,368 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 78 selfloop transitions, 9 changer transitions 0/124 dead transitions. [2023-11-29 05:54:44,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 124 transitions, 582 flow [2023-11-29 05:54:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:54:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:54:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 413 transitions. [2023-11-29 05:54:44,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6849087893864013 [2023-11-29 05:54:44,371 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 413 transitions. [2023-11-29 05:54:44,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 413 transitions. [2023-11-29 05:54:44,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:44,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 413 transitions. [2023-11-29 05:54:44,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 45.888888888888886) internal successors, (413), 9 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:44,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:44,374 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:44,374 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 207 flow. Second operand 9 states and 413 transitions. [2023-11-29 05:54:44,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 124 transitions, 582 flow [2023-11-29 05:54:44,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 552 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:54:44,377 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 244 flow [2023-11-29 05:54:44,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2023-11-29 05:54:44,378 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 4 predicate places. [2023-11-29 05:54:44,378 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 244 flow [2023-11-29 05:54:44,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:44,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:44,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:44,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-29 05:54:44,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:44,580 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:44,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1885169629, now seen corresponding path program 2 times [2023-11-29 05:54:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:44,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387786231] [2023-11-29 05:54:44,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:54:44,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:44,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:44,582 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:44,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 05:54:44,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:54:44,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:54:44,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:54:44,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:44,729 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-29 05:54:44,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:44,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:44,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387786231] [2023-11-29 05:54:44,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387786231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:44,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:44,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:54:44,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431158331] [2023-11-29 05:54:44,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:44,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:54:44,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:44,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:54:44,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:54:44,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:54:44,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:44,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:44,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:54:44,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:45,596 INFO L124 PetriNetUnfolderBase]: 5038/8388 cut-off events. [2023-11-29 05:54:45,596 INFO L125 PetriNetUnfolderBase]: For 3451/3896 co-relation queries the response was YES. [2023-11-29 05:54:45,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20879 conditions, 8388 events. 5038/8388 cut-off events. For 3451/3896 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 58817 event pairs, 2293 based on Foata normal form. 29/7879 useless extension candidates. Maximal degree in co-relation 20862. Up to 3585 conditions per place. [2023-11-29 05:54:45,650 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 67 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2023-11-29 05:54:45,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 110 transitions, 546 flow [2023-11-29 05:54:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:54:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:54:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2023-11-29 05:54:45,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6955223880597015 [2023-11-29 05:54:45,652 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 233 transitions. [2023-11-29 05:54:45,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 233 transitions. [2023-11-29 05:54:45,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:45,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 233 transitions. [2023-11-29 05:54:45,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:45,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:45,654 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:45,654 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 244 flow. Second operand 5 states and 233 transitions. [2023-11-29 05:54:45,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 110 transitions, 546 flow [2023-11-29 05:54:45,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 110 transitions, 538 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:54:45,674 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 320 flow [2023-11-29 05:54:45,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2023-11-29 05:54:45,674 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 8 predicate places. [2023-11-29 05:54:45,674 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 320 flow [2023-11-29 05:54:45,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:45,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:45,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:45,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 05:54:45,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:45,875 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:45,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash 458920183, now seen corresponding path program 3 times [2023-11-29 05:54:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:45,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333528674] [2023-11-29 05:54:45,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:54:45,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:45,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:45,877 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:45,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 05:54:46,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 05:54:46,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:54:46,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:54:46,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:46,062 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-29 05:54:46,062 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:46,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:46,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333528674] [2023-11-29 05:54:46,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333528674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:46,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:46,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:54:46,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554279172] [2023-11-29 05:54:46,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:46,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:54:46,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:46,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:54:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:54:46,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:54:46,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:46,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:46,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:54:46,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:47,662 INFO L124 PetriNetUnfolderBase]: 10211/16904 cut-off events. [2023-11-29 05:54:47,663 INFO L125 PetriNetUnfolderBase]: For 7386/8154 co-relation queries the response was YES. [2023-11-29 05:54:47,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42123 conditions, 16904 events. 10211/16904 cut-off events. For 7386/8154 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 128441 event pairs, 1764 based on Foata normal form. 16/15906 useless extension candidates. Maximal degree in co-relation 42104. Up to 6450 conditions per place. [2023-11-29 05:54:47,795 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 82 selfloop transitions, 14 changer transitions 0/132 dead transitions. [2023-11-29 05:54:47,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 132 transitions, 761 flow [2023-11-29 05:54:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:54:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:54:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2023-11-29 05:54:47,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865671641791045 [2023-11-29 05:54:47,797 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 276 transitions. [2023-11-29 05:54:47,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 276 transitions. [2023-11-29 05:54:47,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:47,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 276 transitions. [2023-11-29 05:54:47,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:47,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:47,799 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:47,799 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 320 flow. Second operand 6 states and 276 transitions. [2023-11-29 05:54:47,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 132 transitions, 761 flow [2023-11-29 05:54:47,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 132 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:54:47,817 INFO L231 Difference]: Finished difference. Result has 90 places, 91 transitions, 507 flow [2023-11-29 05:54:47,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=90, PETRI_TRANSITIONS=91} [2023-11-29 05:54:47,818 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2023-11-29 05:54:47,818 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 91 transitions, 507 flow [2023-11-29 05:54:47,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:47,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:47,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:47,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 05:54:48,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:48,019 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:48,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash 823973187, now seen corresponding path program 4 times [2023-11-29 05:54:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:48,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543167556] [2023-11-29 05:54:48,020 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:54:48,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:48,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:48,021 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:48,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 05:54:48,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:54:48,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:54:48,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:54:48,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:54:48,194 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-29 05:54:48,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:54:48,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:54:48,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543167556] [2023-11-29 05:54:48,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543167556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:54:48,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:54:48,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:54:48,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948492440] [2023-11-29 05:54:48,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:54:48,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:54:48,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:54:48,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:54:48,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:54:48,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 05:54:48,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:48,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:54:48,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 05:54:48,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:54:51,202 INFO L124 PetriNetUnfolderBase]: 17929/29202 cut-off events. [2023-11-29 05:54:51,202 INFO L125 PetriNetUnfolderBase]: For 17362/18062 co-relation queries the response was YES. [2023-11-29 05:54:51,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75325 conditions, 29202 events. 17929/29202 cut-off events. For 17362/18062 co-relation queries the response was YES. Maximal size of possible extension queue 1815. Compared 235105 event pairs, 3516 based on Foata normal form. 16/27398 useless extension candidates. Maximal degree in co-relation 75302. Up to 11457 conditions per place. [2023-11-29 05:54:51,450 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 88 selfloop transitions, 26 changer transitions 0/151 dead transitions. [2023-11-29 05:54:51,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 151 transitions, 1139 flow [2023-11-29 05:54:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:54:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:54:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2023-11-29 05:54:51,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6741293532338308 [2023-11-29 05:54:51,453 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 271 transitions. [2023-11-29 05:54:51,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 271 transitions. [2023-11-29 05:54:51,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:54:51,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 271 transitions. [2023-11-29 05:54:51,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:51,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:51,456 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:51,456 INFO L175 Difference]: Start difference. First operand has 90 places, 91 transitions, 507 flow. Second operand 6 states and 271 transitions. [2023-11-29 05:54:51,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 151 transitions, 1139 flow [2023-11-29 05:54:51,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 151 transitions, 1138 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:54:51,550 INFO L231 Difference]: Finished difference. Result has 98 places, 116 transitions, 943 flow [2023-11-29 05:54:51,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=943, PETRI_PLACES=98, PETRI_TRANSITIONS=116} [2023-11-29 05:54:51,551 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 24 predicate places. [2023-11-29 05:54:51,551 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 116 transitions, 943 flow [2023-11-29 05:54:51,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:54:51,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:54:51,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:51,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 05:54:51,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:51,752 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:54:51,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:54:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -450778241, now seen corresponding path program 5 times [2023-11-29 05:54:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:54:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066092224] [2023-11-29 05:54:51,753 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:54:51,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:51,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:54:51,755 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:54:51,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 05:54:51,939 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:54:51,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 05:54:51,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:54:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:54:52,132 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 05:54:52,133 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:54:52,134 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:54:52,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:54:52,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:54:52,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:54:52,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:54:52,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:54:52,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:54:52,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:54:52,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:54:52,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:54:52,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:54:52,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:54:52,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:54:52,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:54:52,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:54:52,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:54:52,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 05:54:52,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:54:52,344 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:54:52,349 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:54:52,349 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:54:52,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:54:52,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:54:52,427 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:54:52,431 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:54:52,444 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:54:52,445 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:54:52,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:54:52 BasicIcfg [2023-11-29 05:54:52,462 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:54:52,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:54:52,463 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:54:52,463 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:54:52,463 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:54:23" (3/4) ... [2023-11-29 05:54:52,465 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:54:52,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:54:52,467 INFO L158 Benchmark]: Toolchain (without parser) took 30331.99ms. Allocated memory was 79.7MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 51.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 439.9MB. Max. memory is 16.1GB. [2023-11-29 05:54:52,467 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:54:52,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.24ms. Allocated memory is still 79.7MB. Free memory was 51.5MB in the beginning and 43.7MB in the end (delta: 7.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:54:52,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.45ms. Allocated memory is still 79.7MB. Free memory was 43.7MB in the beginning and 41.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:54:52,468 INFO L158 Benchmark]: Boogie Preprocessor took 64.70ms. Allocated memory is still 79.7MB. Free memory was 41.1MB in the beginning and 37.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:54:52,469 INFO L158 Benchmark]: RCFGBuilder took 942.45ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 37.2MB in the beginning and 62.2MB in the end (delta: -24.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2023-11-29 05:54:52,469 INFO L158 Benchmark]: TraceAbstraction took 28746.74ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 61.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 431.8MB. Max. memory is 16.1GB. [2023-11-29 05:54:52,469 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 1.9GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:54:52,472 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.24ms. Allocated memory is still 79.7MB. Free memory was 51.5MB in the beginning and 43.7MB in the end (delta: 7.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.45ms. Allocated memory is still 79.7MB. Free memory was 43.7MB in the beginning and 41.1MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.70ms. Allocated memory is still 79.7MB. Free memory was 41.1MB in the beginning and 37.4MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 942.45ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 37.2MB in the beginning and 62.2MB in the end (delta: -24.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 28746.74ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 61.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 431.8MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 1.9GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t121; [L872] FCALL, FORK 0 pthread_create(&t121, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t121={-2147483645:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t122; [L874] FCALL, FORK 0 pthread_create(&t122, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t121={-2147483645:0}, t122={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t123; [L876] FCALL, FORK 0 pthread_create(&t123, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t121={-2147483645:0}, t122={3:0}, t123={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L877] 0 pthread_t t124; [L878] FCALL, FORK 0 pthread_create(&t124, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t121={-2147483645:0}, t122={3:0}, t123={7:0}, t124={6:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t121={-2147483645:0}, t122={3:0}, t123={7:0}, t124={6:0}, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t121={-2147483645:0}, t122={3:0}, t123={7:0}, t124={6:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t121={-2147483645:0}, t122={3:0}, t123={7:0}, t124={6:0}, weak$$choice2=0, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix005_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 980 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 803 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 83 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2525 IncrementalHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 36 mSDtfsCounter, 2525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=943occurred in iteration=18, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 369 ConstructedInterpolants, 1 QuantifiedInterpolants, 2877 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2561 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 05:54:52,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd20570-7713-4713-b327-5001e1023c3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample