./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix023_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:00:36,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:00:36,924 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:00:36,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:00:36,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:00:36,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:00:36,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:00:36,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:00:36,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:00:36,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:00:36,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:00:36,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:00:36,974 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:00:36,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:00:36,975 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:00:36,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:00:36,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:00:36,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:00:36,979 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:00:36,979 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:00:36,980 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:00:36,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:00:36,982 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:00:36,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:00:36,983 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:00:36,984 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:00:36,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:00:36,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:00:36,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:00:36,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:00:36,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:00:36,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:00:36,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:00:36,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:00:36,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:00:36,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:00:36,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:00:36,991 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:00:36,992 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_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 [2023-11-06 23:00:37,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:00:37,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:00:37,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:00:37,469 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:00:37,470 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:00:37,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix023_tso.i [2023-11-06 23:00:41,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:00:41,970 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:00:41,978 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/sv-benchmarks/c/pthread-wmm/mix023_tso.i [2023-11-06 23:00:42,015 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/data/f040b1668/788b02f2dfcd4ee3b8999be8f0f251c1/FLAGdcc1653c3 [2023-11-06 23:00:42,040 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/data/f040b1668/788b02f2dfcd4ee3b8999be8f0f251c1 [2023-11-06 23:00:42,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:00:42,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:00:42,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:00:42,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:00:42,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:00:42,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:00:42" (1/1) ... [2023-11-06 23:00:42,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abad142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:42, skipping insertion in model container [2023-11-06 23:00:42,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:00:42" (1/1) ... [2023-11-06 23:00:42,171 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:00:42,890 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:00:42,907 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:00:42,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:00:43,047 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:00:43,048 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:00:43,057 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:00:43,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43 WrapperNode [2023-11-06 23:00:43,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:00:43,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:00:43,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:00:43,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:00:43,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (1/1) ... [2023-11-06 23:00:43,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (1/1) ... [2023-11-06 23:00:43,176 INFO L138 Inliner]: procedures = 177, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 290 [2023-11-06 23:00:43,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:00:43,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:00:43,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:00:43,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:00:43,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (1/1) ... [2023-11-06 23:00:43,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (1/1) ... [2023-11-06 23:00:43,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (1/1) ... [2023-11-06 23:00:43,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (1/1) ... [2023-11-06 23:00:43,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (1/1) ... [2023-11-06 23:00:43,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (1/1) ... [2023-11-06 23:00:43,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (1/1) ... [2023-11-06 23:00:43,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (1/1) ... [2023-11-06 23:00:43,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:00:43,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:00:43,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:00:43,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:00:43,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (1/1) ... [2023-11-06 23:00:43,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:00:43,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:43,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:00:43,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:00:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:00:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:00:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:00:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:00:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:00:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:00:43,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:00:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:00:43,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:00:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:00:43,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:00:43,442 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 23:00:43,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 23:00:43,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:00:43,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:00:43,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:00:43,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:00:43,448 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:00:43,667 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:00:43,670 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:00:44,390 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:00:44,758 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:00:44,758 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:00:44,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:44 BoogieIcfgContainer [2023-11-06 23:00:44,763 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:00:44,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:00:44,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:00:44,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:00:44,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:00:42" (1/3) ... [2023-11-06 23:00:44,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bc5014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:00:44, skipping insertion in model container [2023-11-06 23:00:44,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:43" (2/3) ... [2023-11-06 23:00:44,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16bc5014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:00:44, skipping insertion in model container [2023-11-06 23:00:44,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:44" (3/3) ... [2023-11-06 23:00:44,779 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2023-11-06 23:00:44,803 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:00:44,804 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-06 23:00:44,804 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:00:44,919 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:00:45,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 171 transitions, 358 flow [2023-11-06 23:00:45,209 INFO L124 PetriNetUnfolderBase]: 3/167 cut-off events. [2023-11-06 23:00:45,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:00:45,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 167 events. 3/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 127 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-11-06 23:00:45,218 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 171 transitions, 358 flow [2023-11-06 23:00:45,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 167 transitions, 346 flow [2023-11-06 23:00:45,237 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:00:45,265 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 167 transitions, 346 flow [2023-11-06 23:00:45,268 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 167 transitions, 346 flow [2023-11-06 23:00:45,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 167 transitions, 346 flow [2023-11-06 23:00:45,322 INFO L124 PetriNetUnfolderBase]: 3/167 cut-off events. [2023-11-06 23:00:45,322 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:00:45,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 167 events. 3/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 128 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-11-06 23:00:45,329 INFO L119 LiptonReduction]: Number of co-enabled transitions 4344 [2023-11-06 23:01:05,720 INFO L134 LiptonReduction]: Checked pairs total: 13356 [2023-11-06 23:01:05,721 INFO L136 LiptonReduction]: Total number of compositions: 163 [2023-11-06 23:01:05,742 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:01:05,751 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;@68caa8c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:01:05,751 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-06 23:01:05,754 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:01:05,754 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:01:05,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:01:05,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:05,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:01:05,756 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:01:05,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash 908, now seen corresponding path program 1 times [2023-11-06 23:01:05,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:05,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151425756] [2023-11-06 23:01:05,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:05,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:05,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:05,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151425756] [2023-11-06 23:01:05,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151425756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:05,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:05,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:01:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788588434] [2023-11-06 23:01:05,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:05,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:01:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:06,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:01:06,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:01:06,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 334 [2023-11-06 23:01:06,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:06,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:06,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 334 [2023-11-06 23:01:06,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:11,426 INFO L124 PetriNetUnfolderBase]: 10899/14824 cut-off events. [2023-11-06 23:01:11,427 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-06 23:01:11,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29684 conditions, 14824 events. 10899/14824 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 79488 event pairs, 10899 based on Foata normal form. 0/12358 useless extension candidates. Maximal degree in co-relation 29672. Up to 14605 conditions per place. [2023-11-06 23:01:11,594 INFO L140 encePairwiseOnDemand]: 326/334 looper letters, 29 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-11-06 23:01:11,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 136 flow [2023-11-06 23:01:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:01:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:01:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 339 transitions. [2023-11-06 23:01:11,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074850299401198 [2023-11-06 23:01:11,625 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 339 transitions. [2023-11-06 23:01:11,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 339 transitions. [2023-11-06 23:01:11,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:11,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 339 transitions. [2023-11-06 23:01:11,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:11,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:11,654 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:11,657 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 94 flow. Second operand 2 states and 339 transitions. [2023-11-06 23:01:11,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 136 flow [2023-11-06 23:01:11,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:01:11,679 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-11-06 23:01:11,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-06 23:01:11,689 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-11-06 23:01:11,689 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-11-06 23:01:11,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:11,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:11,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:01:11,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:01:11,691 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:01:11,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash 861640028, now seen corresponding path program 1 times [2023-11-06 23:01:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:11,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125530659] [2023-11-06 23:01:11,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:11,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:12,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:12,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125530659] [2023-11-06 23:01:12,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125530659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:12,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:12,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:01:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155343964] [2023-11-06 23:01:12,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:12,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:01:12,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:12,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 334 [2023-11-06 23:01:12,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:12,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:12,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 334 [2023-11-06 23:01:12,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:16,801 INFO L124 PetriNetUnfolderBase]: 8981/12724 cut-off events. [2023-11-06 23:01:16,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:01:16,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25007 conditions, 12724 events. 8981/12724 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 76702 event pairs, 1309 based on Foata normal form. 0/11263 useless extension candidates. Maximal degree in co-relation 25004. Up to 10137 conditions per place. [2023-11-06 23:01:16,905 INFO L140 encePairwiseOnDemand]: 331/334 looper letters, 46 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-06 23:01:16,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 212 flow [2023-11-06 23:01:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:01:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-11-06 23:01:16,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49800399201596807 [2023-11-06 23:01:16,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-11-06 23:01:16,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-11-06 23:01:16,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:16,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-11-06 23:01:16,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:16,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:16,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:16,923 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 499 transitions. [2023-11-06 23:01:16,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 212 flow [2023-11-06 23:01:16,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:01:16,927 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 76 flow [2023-11-06 23:01:16,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-06 23:01:16,929 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-11-06 23:01:16,929 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 76 flow [2023-11-06 23:01:16,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:16,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:16,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:16,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:01:16,931 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:01:16,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:16,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1308966060, now seen corresponding path program 1 times [2023-11-06 23:01:16,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:16,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637465520] [2023-11-06 23:01:16,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:17,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:17,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637465520] [2023-11-06 23:01:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637465520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:17,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:01:17,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716041118] [2023-11-06 23:01:17,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:17,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:01:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:01:17,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:01:17,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 334 [2023-11-06 23:01:17,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:17,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:17,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 334 [2023-11-06 23:01:17,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:20,397 INFO L124 PetriNetUnfolderBase]: 7477/10590 cut-off events. [2023-11-06 23:01:20,398 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2023-11-06 23:01:20,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21411 conditions, 10590 events. 7477/10590 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 60009 event pairs, 1461 based on Foata normal form. 0/9768 useless extension candidates. Maximal degree in co-relation 21407. Up to 7937 conditions per place. [2023-11-06 23:01:20,495 INFO L140 encePairwiseOnDemand]: 331/334 looper letters, 38 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2023-11-06 23:01:20,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 190 flow [2023-11-06 23:01:20,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:01:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-11-06 23:01:20,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49201596806387227 [2023-11-06 23:01:20,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-11-06 23:01:20,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-11-06 23:01:20,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:20,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-11-06 23:01:20,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:20,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:20,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:20,511 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 493 transitions. [2023-11-06 23:01:20,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 190 flow [2023-11-06 23:01:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:01:20,516 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-11-06 23:01:20,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-06 23:01:20,519 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-11-06 23:01:20,519 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-11-06 23:01:20,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:20,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:20,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:20,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:01:20,527 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:01:20,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash -508922296, now seen corresponding path program 1 times [2023-11-06 23:01:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:20,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816320919] [2023-11-06 23:01:20,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:20,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:38,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:38,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816320919] [2023-11-06 23:01:38,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816320919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:38,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:38,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:01:38,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649023353] [2023-11-06 23:01:38,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:38,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:38,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:38,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:38,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:38,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 334 [2023-11-06 23:01:38,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:38,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:38,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 334 [2023-11-06 23:01:38,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:40,838 INFO L124 PetriNetUnfolderBase]: 9235/12574 cut-off events. [2023-11-06 23:01:40,838 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2023-11-06 23:01:40,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25769 conditions, 12574 events. 9235/12574 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 63505 event pairs, 2803 based on Foata normal form. 0/12169 useless extension candidates. Maximal degree in co-relation 25765. Up to 8097 conditions per place. [2023-11-06 23:01:40,915 INFO L140 encePairwiseOnDemand]: 322/334 looper letters, 45 selfloop transitions, 11 changer transitions 0/58 dead transitions. [2023-11-06 23:01:40,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 240 flow [2023-11-06 23:01:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:01:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:01:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2023-11-06 23:01:40,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528443113772455 [2023-11-06 23:01:40,919 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 605 transitions. [2023-11-06 23:01:40,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 605 transitions. [2023-11-06 23:01:40,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:40,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 605 transitions. [2023-11-06 23:01:40,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:40,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:40,927 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:40,927 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 4 states and 605 transitions. [2023-11-06 23:01:40,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 240 flow [2023-11-06 23:01:40,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:01:40,938 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 150 flow [2023-11-06 23:01:40,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-11-06 23:01:40,939 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2023-11-06 23:01:40,939 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 150 flow [2023-11-06 23:01:40,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:40,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:40,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:40,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:01:40,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:01:40,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash -508922274, now seen corresponding path program 1 times [2023-11-06 23:01:40,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:40,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416188940] [2023-11-06 23:01:40,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:40,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:42,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:42,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416188940] [2023-11-06 23:01:42,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416188940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:42,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:42,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:01:42,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208595316] [2023-11-06 23:01:42,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:42,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:01:42,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:01:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:01:42,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 334 [2023-11-06 23:01:42,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:42,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:42,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 334 [2023-11-06 23:01:42,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:44,239 INFO L124 PetriNetUnfolderBase]: 6217/8528 cut-off events. [2023-11-06 23:01:44,240 INFO L125 PetriNetUnfolderBase]: For 4726/5230 co-relation queries the response was YES. [2023-11-06 23:01:44,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21528 conditions, 8528 events. 6217/8528 cut-off events. For 4726/5230 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 43700 event pairs, 2123 based on Foata normal form. 632/8661 useless extension candidates. Maximal degree in co-relation 21522. Up to 7932 conditions per place. [2023-11-06 23:01:44,306 INFO L140 encePairwiseOnDemand]: 329/334 looper letters, 41 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-11-06 23:01:44,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 242 flow [2023-11-06 23:01:44,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:01:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:01:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions. [2023-11-06 23:01:44,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4151696606786427 [2023-11-06 23:01:44,313 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 832 transitions. [2023-11-06 23:01:44,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions. [2023-11-06 23:01:44,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:44,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions. [2023-11-06 23:01:44,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:44,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:44,328 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 334.0) internal successors, (2338), 7 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:44,328 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 150 flow. Second operand 6 states and 832 transitions. [2023-11-06 23:01:44,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 242 flow [2023-11-06 23:01:44,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:01:44,347 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 94 flow [2023-11-06 23:01:44,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2023-11-06 23:01:44,351 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2023-11-06 23:01:44,351 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 94 flow [2023-11-06 23:01:44,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:44,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:44,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:44,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:01:44,354 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:01:44,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash 470766070, now seen corresponding path program 1 times [2023-11-06 23:01:44,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:44,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538352089] [2023-11-06 23:01:44,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:44,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:55,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:55,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538352089] [2023-11-06 23:01:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538352089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:55,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:55,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:01:55,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274727926] [2023-11-06 23:01:55,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:55,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:55,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:55,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:55,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 334 [2023-11-06 23:01:55,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 140.25) internal successors, (561), 4 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-06 23:01:55,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:55,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 334 [2023-11-06 23:01:55,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:57,315 INFO L124 PetriNetUnfolderBase]: 6195/8446 cut-off events. [2023-11-06 23:01:57,315 INFO L125 PetriNetUnfolderBase]: For 1835/1855 co-relation queries the response was YES. [2023-11-06 23:01:57,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21045 conditions, 8446 events. 6195/8446 cut-off events. For 1835/1855 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 42870 event pairs, 1787 based on Foata normal form. 128/8565 useless extension candidates. Maximal degree in co-relation 21039. Up to 6169 conditions per place. [2023-11-06 23:01:57,376 INFO L140 encePairwiseOnDemand]: 331/334 looper letters, 42 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-06 23:01:57,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 233 flow [2023-11-06 23:01:57,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:01:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:01:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2023-11-06 23:01:57,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4550898203592814 [2023-11-06 23:01:57,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2023-11-06 23:01:57,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2023-11-06 23:01:57,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:57,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2023-11-06 23:01:57,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:57,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:57,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:57,389 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 94 flow. Second operand 3 states and 456 transitions. [2023-11-06 23:01:57,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 233 flow [2023-11-06 23:01:57,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 223 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:01:57,393 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 95 flow [2023-11-06 23:01:57,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-11-06 23:01:57,397 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2023-11-06 23:01:57,398 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 95 flow [2023-11-06 23:01:57,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.25) internal successors, (561), 4 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-06 23:01:57,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:57,399 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:57,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:01:57,399 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:01:57,400 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash 789190432, now seen corresponding path program 1 times [2023-11-06 23:01:57,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:57,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972557757] [2023-11-06 23:01:57,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:57,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:01:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:01:57,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:01:57,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972557757] [2023-11-06 23:01:57,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972557757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:01:57,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:01:57,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:01:57,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324208419] [2023-11-06 23:01:57,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:01:57,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:01:57,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:01:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:01:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:01:57,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 334 [2023-11-06 23:01:57,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:57,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:01:57,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 334 [2023-11-06 23:01:57,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:01:59,469 INFO L124 PetriNetUnfolderBase]: 5269/7496 cut-off events. [2023-11-06 23:01:59,470 INFO L125 PetriNetUnfolderBase]: For 3430/3838 co-relation queries the response was YES. [2023-11-06 23:01:59,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19567 conditions, 7496 events. 5269/7496 cut-off events. For 3430/3838 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 40976 event pairs, 1077 based on Foata normal form. 552/7780 useless extension candidates. Maximal degree in co-relation 19560. Up to 4552 conditions per place. [2023-11-06 23:01:59,527 INFO L140 encePairwiseOnDemand]: 327/334 looper letters, 61 selfloop transitions, 9 changer transitions 4/78 dead transitions. [2023-11-06 23:01:59,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 396 flow [2023-11-06 23:01:59,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:01:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:01:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 781 transitions. [2023-11-06 23:01:59,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676646706586826 [2023-11-06 23:01:59,533 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 781 transitions. [2023-11-06 23:01:59,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 781 transitions. [2023-11-06 23:01:59,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:01:59,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 781 transitions. [2023-11-06 23:01:59,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:59,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:59,543 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 334.0) internal successors, (2004), 6 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:59,544 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 95 flow. Second operand 5 states and 781 transitions. [2023-11-06 23:01:59,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 396 flow [2023-11-06 23:01:59,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:01:59,554 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 160 flow [2023-11-06 23:01:59,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-11-06 23:01:59,558 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2023-11-06 23:01:59,558 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 160 flow [2023-11-06 23:01:59,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:01:59,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:01:59,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:01:59,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:01:59,561 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:01:59,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:01:59,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1112046812, now seen corresponding path program 1 times [2023-11-06 23:01:59,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:01:59,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206738487] [2023-11-06 23:01:59,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:01:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:01:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:00,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:00,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206738487] [2023-11-06 23:02:00,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206738487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:00,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:00,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:02:00,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889983] [2023-11-06 23:02:00,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:00,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:02:00,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:00,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:02:00,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:02:00,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 334 [2023-11-06 23:02:00,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:00,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:00,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 334 [2023-11-06 23:02:00,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:01,456 INFO L124 PetriNetUnfolderBase]: 4209/6166 cut-off events. [2023-11-06 23:02:01,456 INFO L125 PetriNetUnfolderBase]: For 4347/4637 co-relation queries the response was YES. [2023-11-06 23:02:01,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19490 conditions, 6166 events. 4209/6166 cut-off events. For 4347/4637 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 34425 event pairs, 702 based on Foata normal form. 343/6316 useless extension candidates. Maximal degree in co-relation 19480. Up to 2545 conditions per place. [2023-11-06 23:02:01,509 INFO L140 encePairwiseOnDemand]: 327/334 looper letters, 88 selfloop transitions, 18 changer transitions 0/110 dead transitions. [2023-11-06 23:02:01,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 110 transitions, 650 flow [2023-11-06 23:02:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:02:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:02:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1095 transitions. [2023-11-06 23:02:01,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46834901625320785 [2023-11-06 23:02:01,516 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1095 transitions. [2023-11-06 23:02:01,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1095 transitions. [2023-11-06 23:02:01,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:01,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1095 transitions. [2023-11-06 23:02:01,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.42857142857142) internal successors, (1095), 7 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:01,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 334.0) internal successors, (2672), 8 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:01,529 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 334.0) internal successors, (2672), 8 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:01,530 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 160 flow. Second operand 7 states and 1095 transitions. [2023-11-06 23:02:01,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 110 transitions, 650 flow [2023-11-06 23:02:01,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 110 transitions, 645 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:02:01,562 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 286 flow [2023-11-06 23:02:01,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=286, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-11-06 23:02:01,563 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-11-06 23:02:01,564 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 286 flow [2023-11-06 23:02:01,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:01,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:01,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:01,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:02:01,565 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:02:01,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1825489669, now seen corresponding path program 1 times [2023-11-06 23:02:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:01,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643090847] [2023-11-06 23:02:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:01,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:02,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:02,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643090847] [2023-11-06 23:02:02,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643090847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:02,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:02,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:02:02,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297652466] [2023-11-06 23:02:02,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:02,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:02:02,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:02,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:02:02,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:02:02,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 334 [2023-11-06 23:02:02,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 144.16666666666666) internal successors, (865), 6 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:02,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:02,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 334 [2023-11-06 23:02:02,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:04,029 INFO L124 PetriNetUnfolderBase]: 3936/5762 cut-off events. [2023-11-06 23:02:04,029 INFO L125 PetriNetUnfolderBase]: For 7854/8124 co-relation queries the response was YES. [2023-11-06 23:02:04,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20668 conditions, 5762 events. 3936/5762 cut-off events. For 7854/8124 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 31971 event pairs, 652 based on Foata normal form. 111/5686 useless extension candidates. Maximal degree in co-relation 20655. Up to 2431 conditions per place. [2023-11-06 23:02:04,076 INFO L140 encePairwiseOnDemand]: 327/334 looper letters, 100 selfloop transitions, 27 changer transitions 10/141 dead transitions. [2023-11-06 23:02:04,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 963 flow [2023-11-06 23:02:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:02:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:02:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1408 transitions. [2023-11-06 23:02:04,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4683965402528277 [2023-11-06 23:02:04,085 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1408 transitions. [2023-11-06 23:02:04,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1408 transitions. [2023-11-06 23:02:04,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:04,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1408 transitions. [2023-11-06 23:02:04,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 156.44444444444446) internal successors, (1408), 9 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:04,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 334.0) internal successors, (3340), 10 states have internal predecessors, (3340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:04,101 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 334.0) internal successors, (3340), 10 states have internal predecessors, (3340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:04,102 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 286 flow. Second operand 9 states and 1408 transitions. [2023-11-06 23:02:04,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 963 flow [2023-11-06 23:02:04,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 141 transitions, 914 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-11-06 23:02:04,390 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 413 flow [2023-11-06 23:02:04,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=413, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-06 23:02:04,392 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2023-11-06 23:02:04,392 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 413 flow [2023-11-06 23:02:04,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.16666666666666) internal successors, (865), 6 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:04,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:04,393 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] [2023-11-06 23:02:04,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:02:04,394 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:02:04,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:04,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1498231983, now seen corresponding path program 1 times [2023-11-06 23:02:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156118764] [2023-11-06 23:02:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:04,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:04,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:04,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156118764] [2023-11-06 23:02:04,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156118764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:04,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:04,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:02:04,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450488062] [2023-11-06 23:02:04,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:04,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:02:04,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:04,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:02:04,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:02:04,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 334 [2023-11-06 23:02:04,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 413 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:04,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:04,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 334 [2023-11-06 23:02:04,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:06,264 INFO L124 PetriNetUnfolderBase]: 5078/7803 cut-off events. [2023-11-06 23:02:06,264 INFO L125 PetriNetUnfolderBase]: For 16944/17057 co-relation queries the response was YES. [2023-11-06 23:02:06,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28540 conditions, 7803 events. 5078/7803 cut-off events. For 16944/17057 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 49416 event pairs, 834 based on Foata normal form. 11/7661 useless extension candidates. Maximal degree in co-relation 28524. Up to 4401 conditions per place. [2023-11-06 23:02:06,308 INFO L140 encePairwiseOnDemand]: 331/334 looper letters, 79 selfloop transitions, 2 changer transitions 48/132 dead transitions. [2023-11-06 23:02:06,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 132 transitions, 1306 flow [2023-11-06 23:02:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:02:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:02:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2023-11-06 23:02:06,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48577844311377244 [2023-11-06 23:02:06,312 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 649 transitions. [2023-11-06 23:02:06,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 649 transitions. [2023-11-06 23:02:06,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:06,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 649 transitions. [2023-11-06 23:02:06,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:06,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:06,318 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:06,319 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 413 flow. Second operand 4 states and 649 transitions. [2023-11-06 23:02:06,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 132 transitions, 1306 flow [2023-11-06 23:02:06,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 132 transitions, 1045 flow, removed 94 selfloop flow, removed 4 redundant places. [2023-11-06 23:02:06,686 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 295 flow [2023-11-06 23:02:06,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-11-06 23:02:06,687 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2023-11-06 23:02:06,687 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 295 flow [2023-11-06 23:02:06,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:06,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:06,687 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] [2023-11-06 23:02:06,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:02:06,688 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:02:06,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash 491142099, now seen corresponding path program 2 times [2023-11-06 23:02:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:06,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206792549] [2023-11-06 23:02:06,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206792549] [2023-11-06 23:02:09,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206792549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:09,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:09,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:02:09,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318564054] [2023-11-06 23:02:09,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:09,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:02:09,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:09,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:02:09,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:02:09,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 334 [2023-11-06 23:02:09,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 295 flow. Second operand has 10 states, 10 states have (on average 147.3) internal successors, (1473), 10 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:09,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:09,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 334 [2023-11-06 23:02:09,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:12,750 INFO L124 PetriNetUnfolderBase]: 8559/13340 cut-off events. [2023-11-06 23:02:12,750 INFO L125 PetriNetUnfolderBase]: For 15147/15342 co-relation queries the response was YES. [2023-11-06 23:02:12,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44053 conditions, 13340 events. 8559/13340 cut-off events. For 15147/15342 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 90028 event pairs, 894 based on Foata normal form. 18/13157 useless extension candidates. Maximal degree in co-relation 44034. Up to 5599 conditions per place. [2023-11-06 23:02:12,843 INFO L140 encePairwiseOnDemand]: 325/334 looper letters, 150 selfloop transitions, 16 changer transitions 23/193 dead transitions. [2023-11-06 23:02:12,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 193 transitions, 1441 flow [2023-11-06 23:02:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:02:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:02:12,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1127 transitions. [2023-11-06 23:02:12,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820359281437126 [2023-11-06 23:02:12,849 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1127 transitions. [2023-11-06 23:02:12,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1127 transitions. [2023-11-06 23:02:12,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:12,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1127 transitions. [2023-11-06 23:02:12,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.0) internal successors, (1127), 7 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:12,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 334.0) internal successors, (2672), 8 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:12,859 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 334.0) internal successors, (2672), 8 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:12,859 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 295 flow. Second operand 7 states and 1127 transitions. [2023-11-06 23:02:12,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 193 transitions, 1441 flow [2023-11-06 23:02:13,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 193 transitions, 1428 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 23:02:13,392 INFO L231 Difference]: Finished difference. Result has 75 places, 64 transitions, 427 flow [2023-11-06 23:02:13,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=427, PETRI_PLACES=75, PETRI_TRANSITIONS=64} [2023-11-06 23:02:13,393 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2023-11-06 23:02:13,393 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 64 transitions, 427 flow [2023-11-06 23:02:13,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 147.3) internal successors, (1473), 10 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:13,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:13,394 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] [2023-11-06 23:02:13,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:02:13,394 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:02:13,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1236653887, now seen corresponding path program 3 times [2023-11-06 23:02:13,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:13,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246087090] [2023-11-06 23:02:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:13,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:13,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246087090] [2023-11-06 23:02:13,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246087090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:13,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:13,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:02:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853703190] [2023-11-06 23:02:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:13,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:02:13,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:13,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:02:13,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:02:14,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 334 [2023-11-06 23:02:14,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 64 transitions, 427 flow. Second operand has 7 states, 7 states have (on average 144.14285714285714) internal successors, (1009), 7 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:14,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:14,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 334 [2023-11-06 23:02:14,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:15,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][70], [Black: 257#(= ~a~0 1), 137#L852true, Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), 48#L891true, Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 232#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 120#L801true, 70#L3true, Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), P2Thread1of1ForFork0InUse, 294#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:15,305 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 23:02:15,305 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 23:02:15,305 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 23:02:15,306 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 23:02:15,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][70], [Black: 257#(= ~a~0 1), 137#L852true, Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 48#L891true, Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, 232#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 70#L3true, Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, 4#L817true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 294#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:15,589 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,589 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,590 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,590 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][46], [Black: 257#(= ~a~0 1), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), 242#(<= ~__unbuffered_cnt~0 1), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 48#L891true, Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 289#(<= ~__unbuffered_cnt~0 1), Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, 4#L817true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 64#L927-3true, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:15,592 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,592 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,592 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,593 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][99], [Black: 257#(= ~a~0 1), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), 48#L891true, Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 296#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 120#L801true, 70#L3true, 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:15,607 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,607 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,607 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,607 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:02:15,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][70], [Black: 257#(= ~a~0 1), 137#L852true, Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 48#L891true, Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, 232#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 70#L3true, 71#L820true, Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 294#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:15,864 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:02:15,864 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:15,864 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:15,864 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:15,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][46], [Black: 257#(= ~a~0 1), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), 242#(<= ~__unbuffered_cnt~0 1), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 48#L891true, Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 289#(<= ~__unbuffered_cnt~0 1), 71#L820true, Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 64#L927-3true, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:15,866 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:02:15,867 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:15,867 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:15,867 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:15,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][99], [Black: 257#(= ~a~0 1), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 48#L891true, Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 296#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 70#L3true, 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, 4#L817true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:15,885 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:02:15,885 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:15,885 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:15,885 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:02:16,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][70], [Black: 257#(= ~a~0 1), 137#L852true, Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 48#L891true, Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, 232#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 70#L3true, Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 38#L827true, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 294#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,289 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,289 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,290 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,290 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][70], [Black: 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 137#L852true, Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), 257#(= ~a~0 1), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, 232#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 70#L3true, 71#L820true, Black: 229#(<= ~__unbuffered_cnt~0 1), 173#L903true, Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 294#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,295 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,295 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,295 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,295 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][46], [Black: 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 137#L852true, Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), 96#P3EXITtrue, 242#(<= ~__unbuffered_cnt~0 1), 257#(= ~a~0 1), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 289#(<= ~__unbuffered_cnt~0 1), 71#L820true, Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 64#L927-3true, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,296 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,296 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,296 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,297 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][46], [Black: 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), 242#(<= ~__unbuffered_cnt~0 1), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), 257#(= ~a~0 1), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 289#(<= ~__unbuffered_cnt~0 1), 71#L820true, 173#L903true, Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 64#L927-3true, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,299 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,299 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,299 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,299 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:02:16,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][99], [Black: 257#(= ~a~0 1), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 48#L891true, Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 296#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 70#L3true, 71#L820true, 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,479 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-11-06 23:02:16,479 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-06 23:02:16,479 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-06 23:02:16,479 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-06 23:02:16,485 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][117], [Black: 257#(= ~a~0 1), 243#(<= ~__unbuffered_cnt~0 2), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 290#(<= ~__unbuffered_cnt~0 2), 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 48#L891true, Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 125#P1EXITtrue, P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 64#L927-3true, 184#true, Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,485 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,485 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,485 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,485 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][99], [Black: 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 137#L852true, Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), 96#P3EXITtrue, Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), 257#(= ~a~0 1), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 296#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 70#L3true, 71#L820true, 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,492 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,492 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,492 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,492 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,493 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][117], [Black: 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 243#(<= ~__unbuffered_cnt~0 2), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 290#(<= ~__unbuffered_cnt~0 2), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), 96#P3EXITtrue, Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), 257#(= ~a~0 1), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 71#L820true, Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 64#L927-3true, 184#true, Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,494 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,494 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,494 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,494 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][99], [Black: 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), 257#(= ~a~0 1), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 296#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 70#L3true, 71#L820true, 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 173#L903true, Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,498 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,498 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,498 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,498 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:02:16,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][138], [Black: 257#(= ~a~0 1), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), 48#L891true, Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 298#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 70#L3true, Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 125#P1EXITtrue, P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,673 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,673 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,674 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,674 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][138], [Black: 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), 96#P3EXITtrue, 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), 257#(= ~a~0 1), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 298#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 70#L3true, 71#L820true, Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,676 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,677 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,677 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,677 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([680] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0))) (.cse4 (not (= 0 (mod v_~x$w_buff0_used~0_71 256))))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_72 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_65 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_22) v_~x$r_buff0_thd1~0_21) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_65) v_~x$w_buff1_used~0_64) (= (ite .cse2 0 v_~x$w_buff0_used~0_72) v_~x$w_buff0_used~0_71) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_16) v_~x$r_buff1_thd1~0_15) (= (ite .cse2 v_~x$w_buff0~0_23 (ite .cse1 v_~x$w_buff1~0_20 v_~x~0_38)) v_~x~0_37)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_16, ~x~0=v_~x~0_38, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15, ~x~0=v_~x~0_37, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][138], [Black: 260#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 198#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= 2 ~x$w_buff1~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (or (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0)))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~z$w_buff0~0 2)) (not (= 2 ~x$w_buff1~0))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~z$w_buff0~0 2)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 197#(<= ~__unbuffered_p3_EAX~0 0), 208#(and (not (= |ULTIMATE.start_main_~#t628~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t627~0#1.base| 0) |ULTIMATE.start_main_~#t625~0#1.base| 0) |ULTIMATE.start_main_~#t626~0#1.base| 0) |ULTIMATE.start_main_~#t628~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t625~0#1.base| |ULTIMATE.start_main_~#t627~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t625~0#1.base|)) (not (= |ULTIMATE.start_main_~#t626~0#1.base| |ULTIMATE.start_main_~#t628~0#1.base|))), Black: 212#(= ~__unbuffered_p1_EAX~0 0), 96#P3EXITtrue, 250#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 277#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (= ~x$r_buff1_thd0~0 0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0)), 257#(= ~a~0 1), Black: 268#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (or (= ~x$w_buff0_used~0 1) (= ~x$w_buff0_used~0 0)) (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 0) (= 1 ~x$r_buff0_thd2~0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 269#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))), Black: 275#(and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (or (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (= ~x$r_buff1_thd0~0 0) (= 1 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd1~0 0))) (= 0 ~x$r_buff0_thd1~0) (not (= 2 ~x~0)) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (= ~x~0 1)) (<= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd1~0 0)))), Black: 279#(and (or (not (= 2 ~__unbuffered_p1_EAX~0)) (and (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0))) (or (and (<= ~x$r_buff0_thd4~0 (* 256 (div ~x$r_buff0_thd4~0 256))) (<= 0 ~x$r_buff0_thd4~0)) (not (= 2 ~__unbuffered_p1_EAX~0)))), 264#true, Black: 221#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 218#(not (= 4 ~__unbuffered_cnt~0)), 298#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 70#L3true, 71#L820true, Black: 229#(<= ~__unbuffered_cnt~0 1), Black: 234#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 230#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), P3Thread1of1ForFork2InUse, 40#L781true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork0InUse, 76#P2EXITtrue, 184#true, Black: 243#(<= ~__unbuffered_cnt~0 2), Black: 244#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)]) [2023-11-06 23:02:16,678 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,678 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,678 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,678 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:02:16,912 INFO L124 PetriNetUnfolderBase]: 8197/12355 cut-off events. [2023-11-06 23:02:16,912 INFO L125 PetriNetUnfolderBase]: For 41240/41724 co-relation queries the response was YES. [2023-11-06 23:02:16,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53384 conditions, 12355 events. 8197/12355 cut-off events. For 41240/41724 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 82141 event pairs, 889 based on Foata normal form. 82/11926 useless extension candidates. Maximal degree in co-relation 53361. Up to 5576 conditions per place. [2023-11-06 23:02:16,997 INFO L140 encePairwiseOnDemand]: 327/334 looper letters, 125 selfloop transitions, 27 changer transitions 30/187 dead transitions. [2023-11-06 23:02:16,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 187 transitions, 1600 flow [2023-11-06 23:02:16,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:02:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 23:02:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1686 transitions. [2023-11-06 23:02:17,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4589003810560697 [2023-11-06 23:02:17,005 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1686 transitions. [2023-11-06 23:02:17,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1686 transitions. [2023-11-06 23:02:17,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:17,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1686 transitions. [2023-11-06 23:02:17,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 153.27272727272728) internal successors, (1686), 11 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:17,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 334.0) internal successors, (4008), 12 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:17,023 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 334.0) internal successors, (4008), 12 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:17,023 INFO L175 Difference]: Start difference. First operand has 75 places, 64 transitions, 427 flow. Second operand 11 states and 1686 transitions. [2023-11-06 23:02:17,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 187 transitions, 1600 flow [2023-11-06 23:02:17,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 187 transitions, 1567 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 23:02:17,697 INFO L231 Difference]: Finished difference. Result has 85 places, 64 transitions, 489 flow [2023-11-06 23:02:17,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=489, PETRI_PLACES=85, PETRI_TRANSITIONS=64} [2023-11-06 23:02:17,699 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2023-11-06 23:02:17,699 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 64 transitions, 489 flow [2023-11-06 23:02:17,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 144.14285714285714) internal successors, (1009), 7 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:17,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:17,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:17,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:02:17,701 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:02:17,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:17,701 INFO L85 PathProgramCache]: Analyzing trace with hash -72680125, now seen corresponding path program 1 times [2023-11-06 23:02:17,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:17,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594970784] [2023-11-06 23:02:17,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:17,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:18,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-06 23:02:18,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:18,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594970784] [2023-11-06 23:02:18,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594970784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:18,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:18,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:02:18,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889408462] [2023-11-06 23:02:18,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:18,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:02:18,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:18,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:02:18,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:02:18,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 334 [2023-11-06 23:02:18,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 64 transitions, 489 flow. Second operand has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:18,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:18,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 334 [2023-11-06 23:02:18,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:20,556 INFO L124 PetriNetUnfolderBase]: 8394/13476 cut-off events. [2023-11-06 23:02:20,556 INFO L125 PetriNetUnfolderBase]: For 45073/45091 co-relation queries the response was YES. [2023-11-06 23:02:20,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57741 conditions, 13476 events. 8394/13476 cut-off events. For 45073/45091 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 96633 event pairs, 1034 based on Foata normal form. 2/13309 useless extension candidates. Maximal degree in co-relation 57717. Up to 6645 conditions per place. [2023-11-06 23:02:20,667 INFO L140 encePairwiseOnDemand]: 331/334 looper letters, 66 selfloop transitions, 1 changer transitions 70/141 dead transitions. [2023-11-06 23:02:20,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 141 transitions, 1386 flow [2023-11-06 23:02:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:02:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:02:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2023-11-06 23:02:20,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48278443113772457 [2023-11-06 23:02:20,671 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 645 transitions. [2023-11-06 23:02:20,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 645 transitions. [2023-11-06 23:02:20,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:20,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 645 transitions. [2023-11-06 23:02:20,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:20,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:20,679 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 334.0) internal successors, (1670), 5 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:20,679 INFO L175 Difference]: Start difference. First operand has 85 places, 64 transitions, 489 flow. Second operand 4 states and 645 transitions. [2023-11-06 23:02:20,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 141 transitions, 1386 flow [2023-11-06 23:02:21,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 141 transitions, 1154 flow, removed 54 selfloop flow, removed 10 redundant places. [2023-11-06 23:02:21,213 INFO L231 Difference]: Finished difference. Result has 78 places, 52 transitions, 310 flow [2023-11-06 23:02:21,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=78, PETRI_TRANSITIONS=52} [2023-11-06 23:02:21,214 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2023-11-06 23:02:21,214 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 52 transitions, 310 flow [2023-11-06 23:02:21,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:21,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:21,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:21,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:02:21,216 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:02:21,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash -416048725, now seen corresponding path program 2 times [2023-11-06 23:02:21,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:21,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939071724] [2023-11-06 23:02:21,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:21,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:24,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:24,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939071724] [2023-11-06 23:02:24,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939071724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:24,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:24,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:02:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177979239] [2023-11-06 23:02:24,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:24,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:02:24,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:24,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:02:24,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:02:24,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 334 [2023-11-06 23:02:24,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 52 transitions, 310 flow. Second operand has 9 states, 9 states have (on average 147.88888888888889) internal successors, (1331), 9 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:24,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:02:24,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 334 [2023-11-06 23:02:24,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:02:25,748 INFO L124 PetriNetUnfolderBase]: 4435/7030 cut-off events. [2023-11-06 23:02:25,748 INFO L125 PetriNetUnfolderBase]: For 18986/19026 co-relation queries the response was YES. [2023-11-06 23:02:25,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28305 conditions, 7030 events. 4435/7030 cut-off events. For 18986/19026 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 42891 event pairs, 995 based on Foata normal form. 2/6915 useless extension candidates. Maximal degree in co-relation 28283. Up to 2582 conditions per place. [2023-11-06 23:02:25,800 INFO L140 encePairwiseOnDemand]: 328/334 looper letters, 99 selfloop transitions, 10 changer transitions 63/176 dead transitions. [2023-11-06 23:02:25,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 176 transitions, 1456 flow [2023-11-06 23:02:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:02:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:02:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1102 transitions. [2023-11-06 23:02:25,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713430282292558 [2023-11-06 23:02:25,808 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1102 transitions. [2023-11-06 23:02:25,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1102 transitions. [2023-11-06 23:02:25,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:02:25,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1102 transitions. [2023-11-06 23:02:25,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.42857142857142) internal successors, (1102), 7 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:25,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 334.0) internal successors, (2672), 8 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:25,820 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 334.0) internal successors, (2672), 8 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:25,820 INFO L175 Difference]: Start difference. First operand has 78 places, 52 transitions, 310 flow. Second operand 7 states and 1102 transitions. [2023-11-06 23:02:25,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 176 transitions, 1456 flow [2023-11-06 23:02:26,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 176 transitions, 1418 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-11-06 23:02:26,019 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 338 flow [2023-11-06 23:02:26,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-11-06 23:02:26,021 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2023-11-06 23:02:26,021 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 338 flow [2023-11-06 23:02:26,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 147.88888888888889) internal successors, (1331), 9 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:02:26,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:02:26,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:26,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:02:26,023 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:02:26,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash 943768291, now seen corresponding path program 3 times [2023-11-06 23:02:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:26,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495597869] [2023-11-06 23:02:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:26,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:02:26,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:02:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:02:26,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:02:26,577 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:02:26,578 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2023-11-06 23:02:26,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (16 of 18 remaining) [2023-11-06 23:02:26,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (15 of 18 remaining) [2023-11-06 23:02:26,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2023-11-06 23:02:26,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2023-11-06 23:02:26,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2023-11-06 23:02:26,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2023-11-06 23:02:26,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2023-11-06 23:02:26,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2023-11-06 23:02:26,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2023-11-06 23:02:26,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2023-11-06 23:02:26,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (6 of 18 remaining) [2023-11-06 23:02:26,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 18 remaining) [2023-11-06 23:02:26,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 18 remaining) [2023-11-06 23:02:26,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 18 remaining) [2023-11-06 23:02:26,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 18 remaining) [2023-11-06 23:02:26,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 18 remaining) [2023-11-06 23:02:26,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 18 remaining) [2023-11-06 23:02:26,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:02:26,585 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:26,594 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:02:26,594 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:02:26,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:02:26 BasicIcfg [2023-11-06 23:02:26,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:02:26,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:02:26,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:02:26,796 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:02:26,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:44" (3/4) ... [2023-11-06 23:02:26,799 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:02:26,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:02:26,802 INFO L158 Benchmark]: Toolchain (without parser) took 104744.30ms. Allocated memory was 136.3MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 102.5MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-06 23:02:26,802 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 136.3MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:02:26,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 995.82ms. Allocated memory is still 136.3MB. Free memory was 102.5MB in the beginning and 73.2MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-06 23:02:26,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.52ms. Allocated memory is still 136.3MB. Free memory was 73.2MB in the beginning and 69.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:02:26,804 INFO L158 Benchmark]: Boogie Preprocessor took 56.72ms. Allocated memory is still 136.3MB. Free memory was 69.0MB in the beginning and 66.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:02:26,805 INFO L158 Benchmark]: RCFGBuilder took 1525.19ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 66.1MB in the beginning and 68.1MB in the end (delta: -2.0MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2023-11-06 23:02:26,805 INFO L158 Benchmark]: TraceAbstraction took 102028.04ms. Allocated memory was 182.5MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 67.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-06 23:02:26,805 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 4.1GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:02:26,809 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.39ms. Allocated memory is still 136.3MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 995.82ms. Allocated memory is still 136.3MB. Free memory was 102.5MB in the beginning and 73.2MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.52ms. Allocated memory is still 136.3MB. Free memory was 73.2MB in the beginning and 69.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.72ms. Allocated memory is still 136.3MB. Free memory was 69.0MB in the beginning and 66.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1525.19ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 66.1MB in the beginning and 68.1MB in the end (delta: -2.0MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. * TraceAbstraction took 102028.04ms. Allocated memory was 182.5MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 67.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 5.31ms. Allocated memory is still 4.1GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.5s, 177 PlacesBefore, 54 PlacesAfterwards, 167 TransitionsBefore, 41 TransitionsAfterwards, 4344 CoEnabledTransitionPairs, 8 FixpointIterations, 65 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 163 TotalNumberOfCompositions, 13356 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5198, independent: 4896, independent conditional: 0, independent unconditional: 4896, dependent: 302, dependent conditional: 0, dependent unconditional: 302, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2332, independent: 2262, independent conditional: 0, independent unconditional: 2262, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5198, independent: 2634, independent conditional: 0, independent unconditional: 2634, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 2332, unknown conditional: 0, unknown unconditional: 2332] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t625; [L921] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t625, ((void *)0), P0, ((void *)0))=-4, t625={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L922] 0 pthread_t t626; [L923] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t626, ((void *)0), P1, ((void *)0))=-3, t625={5:0}, t626={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L794] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L794] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L924] 0 pthread_t t627; [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L925] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t627, ((void *)0), P2, ((void *)0))=-2, t625={5:0}, t626={6:0}, t627={7:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L926] 0 pthread_t t628; [L836] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L927] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t628, ((void *)0), P3, ((void *)0))=-1, t625={5:0}, t626={6:0}, t627={7:0}, t628={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 3 return 0; [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L865] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L865] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L890] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L770] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L773] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L907] 4 return 0; [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 2 return 0; [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L931] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L931] RET 0 assume_abort_if_not(main$tmp_guard0) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625={5:0}, t626={6:0}, t627={7:0}, t628={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L973] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix023_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:51}, \read(__PRETTY_FUNCTION__)={52:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 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: 918]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 927]: 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: 923]: 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: 921]: 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: 925]: 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, 209 locations, 18 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: 101.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 39.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1056 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 885 mSDsluCounter, 291 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2182 IncrementalHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 108 mSDtfsCounter, 2182 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=489occurred in iteration=12, InterpolantAutomatonStates: 75, 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, 1.3s SatisfiabilityAnalysisTime, 39.1s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 3932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-06 23:02:26,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:02:30,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:02:30,278 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 23:02:30,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:02:30,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:02:30,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:02:30,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:02:30,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:02:30,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:02:30,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:02:30,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:02:30,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:02:30,355 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:02:30,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:02:30,357 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:02:30,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:02:30,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:02:30,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:02:30,359 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:02:30,360 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:02:30,361 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:02:30,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:02:30,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:02:30,362 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:02:30,363 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:02:30,363 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:02:30,364 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:02:30,364 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:02:30,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:02:30,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:02:30,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:02:30,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:02:30,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:02:30,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:02:30,367 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:02:30,367 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:02:30,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:02:30,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:02:30,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:02:30,368 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:02:30,369 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:02:30,369 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_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19245e5542f28ce8a07a1858e0d4c05190b543a3d82e804c6a4eebc044c13d81 [2023-11-06 23:02:30,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:02:30,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:02:30,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:02:30,808 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:02:30,808 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:02:30,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix023_tso.i [2023-11-06 23:02:34,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:02:34,428 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:02:34,429 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/sv-benchmarks/c/pthread-wmm/mix023_tso.i [2023-11-06 23:02:34,459 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/data/d611a9edb/462204a3250e4f4a83c3b95fb4e573d9/FLAG1ad466933 [2023-11-06 23:02:34,477 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/data/d611a9edb/462204a3250e4f4a83c3b95fb4e573d9 [2023-11-06 23:02:34,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:02:34,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:02:34,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:02:34,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:02:34,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:02:34,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:02:34" (1/1) ... [2023-11-06 23:02:34,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796c0071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:34, skipping insertion in model container [2023-11-06 23:02:34,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:02:34" (1/1) ... [2023-11-06 23:02:34,583 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:02:35,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:02:35,330 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:02:35,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:02:35,490 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:02:35,490 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:02:35,498 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:02:35,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35 WrapperNode [2023-11-06 23:02:35,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:02:35,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:02:35,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:02:35,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:02:35,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (1/1) ... [2023-11-06 23:02:35,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (1/1) ... [2023-11-06 23:02:35,607 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 291 [2023-11-06 23:02:35,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:02:35,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:02:35,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:02:35,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:02:35,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (1/1) ... [2023-11-06 23:02:35,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (1/1) ... [2023-11-06 23:02:35,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (1/1) ... [2023-11-06 23:02:35,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (1/1) ... [2023-11-06 23:02:35,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (1/1) ... [2023-11-06 23:02:35,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (1/1) ... [2023-11-06 23:02:35,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (1/1) ... [2023-11-06 23:02:35,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (1/1) ... [2023-11-06 23:02:35,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:02:35,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:02:35,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:02:35,710 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:02:35,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (1/1) ... [2023-11-06 23:02:35,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:02:35,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:35,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:02:35,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:02:35,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:02:35,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:02:35,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:02:35,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:02:35,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:02:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:02:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:02:35,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:02:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:02:35,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:02:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:02:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:02:35,795 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 23:02:35,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 23:02:35,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:02:35,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:02:35,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:02:35,798 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:02:36,010 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:02:36,012 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:02:36,742 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:02:37,193 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:02:37,194 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:02:37,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:02:37 BoogieIcfgContainer [2023-11-06 23:02:37,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:02:37,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:02:37,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:02:37,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:02:37,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:02:34" (1/3) ... [2023-11-06 23:02:37,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c03d1ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:02:37, skipping insertion in model container [2023-11-06 23:02:37,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:35" (2/3) ... [2023-11-06 23:02:37,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c03d1ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:02:37, skipping insertion in model container [2023-11-06 23:02:37,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:02:37" (3/3) ... [2023-11-06 23:02:37,214 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2023-11-06 23:02:37,240 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:02:37,240 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-06 23:02:37,240 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:02:37,379 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:02:37,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 172 transitions, 360 flow [2023-11-06 23:02:37,604 INFO L124 PetriNetUnfolderBase]: 3/168 cut-off events. [2023-11-06 23:02:37,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:02:37,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 3/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 123 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-11-06 23:02:37,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 172 transitions, 360 flow [2023-11-06 23:02:37,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 168 transitions, 348 flow [2023-11-06 23:02:37,638 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:02:37,657 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 168 transitions, 348 flow [2023-11-06 23:02:37,662 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 168 transitions, 348 flow [2023-11-06 23:02:37,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 168 transitions, 348 flow [2023-11-06 23:02:37,750 INFO L124 PetriNetUnfolderBase]: 3/168 cut-off events. [2023-11-06 23:02:37,750 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:02:37,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 3/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-11-06 23:02:37,759 INFO L119 LiptonReduction]: Number of co-enabled transitions 4344 [2023-11-06 23:03:01,361 INFO L134 LiptonReduction]: Checked pairs total: 13161 [2023-11-06 23:03:01,361 INFO L136 LiptonReduction]: Total number of compositions: 174 [2023-11-06 23:03:01,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:03:01,389 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;@37fa5954, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:03:01,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-11-06 23:03:01,409 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:03:01,409 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:03:01,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:01,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:01,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:03:01,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:01,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash 920, now seen corresponding path program 1 times [2023-11-06 23:03:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:01,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311541601] [2023-11-06 23:03:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:01,431 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-06 23:03:01,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:01,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:01,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:01,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 23:03:01,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:01,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:01,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:01,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311541601] [2023-11-06 23:03:01,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311541601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:01,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:01,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:03:01,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691784288] [2023-11-06 23:03:01,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:01,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:03:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:01,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:03:01,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:03:01,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 346 [2023-11-06 23:03:01,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:01,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:01,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 346 [2023-11-06 23:03:01,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:05,934 INFO L124 PetriNetUnfolderBase]: 10899/14829 cut-off events. [2023-11-06 23:03:05,934 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2023-11-06 23:03:05,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29689 conditions, 14829 events. 10899/14829 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 79708 event pairs, 10899 based on Foata normal form. 0/12360 useless extension candidates. Maximal degree in co-relation 29677. Up to 14605 conditions per place. [2023-11-06 23:03:06,065 INFO L140 encePairwiseOnDemand]: 338/346 looper letters, 29 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-11-06 23:03:06,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 136 flow [2023-11-06 23:03:06,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:03:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:03:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 341 transitions. [2023-11-06 23:03:06,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49277456647398843 [2023-11-06 23:03:06,093 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 341 transitions. [2023-11-06 23:03:06,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 341 transitions. [2023-11-06 23:03:06,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:06,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 341 transitions. [2023-11-06 23:03:06,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 170.5) internal successors, (341), 2 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:06,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:06,117 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:06,119 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 94 flow. Second operand 2 states and 341 transitions. [2023-11-06 23:03:06,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 136 flow [2023-11-06 23:03:06,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:03:06,132 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-11-06 23:03:06,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-06 23:03:06,139 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-11-06 23:03:06,139 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-11-06 23:03:06,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:06,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:06,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:03:06,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:06,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:06,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:06,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:06,352 INFO L85 PathProgramCache]: Analyzing trace with hash 872608096, now seen corresponding path program 1 times [2023-11-06 23:03:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:06,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908183861] [2023-11-06 23:03:06,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:06,354 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-06 23:03:06,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:06,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:06,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:06,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:03:06,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:06,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:06,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:06,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908183861] [2023-11-06 23:03:06,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908183861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:06,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:06,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:03:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90553884] [2023-11-06 23:03:06,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:06,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:06,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:06,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:06,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:06,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 346 [2023-11-06 23:03:06,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:06,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:06,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 346 [2023-11-06 23:03:06,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:10,210 INFO L124 PetriNetUnfolderBase]: 8981/12723 cut-off events. [2023-11-06 23:03:10,211 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:10,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25006 conditions, 12723 events. 8981/12723 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 76252 event pairs, 1309 based on Foata normal form. 0/11262 useless extension candidates. Maximal degree in co-relation 25003. Up to 10137 conditions per place. [2023-11-06 23:03:10,303 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 46 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-06 23:03:10,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 212 flow [2023-11-06 23:03:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:10,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2023-11-06 23:03:10,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4836223506743738 [2023-11-06 23:03:10,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2023-11-06 23:03:10,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2023-11-06 23:03:10,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:10,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2023-11-06 23:03:10,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:10,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:10,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:10,321 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 502 transitions. [2023-11-06 23:03:10,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 212 flow [2023-11-06 23:03:10,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:03:10,324 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 76 flow [2023-11-06 23:03:10,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-06 23:03:10,326 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-11-06 23:03:10,326 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 76 flow [2023-11-06 23:03:10,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:10,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:10,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:10,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:10,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:10,541 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:10,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1313650959, now seen corresponding path program 1 times [2023-11-06 23:03:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898578502] [2023-11-06 23:03:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:10,544 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-06 23:03:10,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:10,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:10,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:10,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:03:10,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:10,758 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:10,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:10,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898578502] [2023-11-06 23:03:10,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898578502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:10,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:10,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:03:10,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421653313] [2023-11-06 23:03:10,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:10,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:10,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:10,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:10,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:10,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 346 [2023-11-06 23:03:10,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:10,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:10,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 346 [2023-11-06 23:03:10,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:13,315 INFO L124 PetriNetUnfolderBase]: 7477/10591 cut-off events. [2023-11-06 23:03:13,315 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2023-11-06 23:03:13,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21412 conditions, 10591 events. 7477/10591 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 60020 event pairs, 1461 based on Foata normal form. 0/9770 useless extension candidates. Maximal degree in co-relation 21408. Up to 7937 conditions per place. [2023-11-06 23:03:13,381 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 38 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2023-11-06 23:03:13,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 190 flow [2023-11-06 23:03:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2023-11-06 23:03:13,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47784200385356457 [2023-11-06 23:03:13,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2023-11-06 23:03:13,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2023-11-06 23:03:13,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:13,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2023-11-06 23:03:13,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:13,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:13,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:13,397 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 496 transitions. [2023-11-06 23:03:13,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 190 flow [2023-11-06 23:03:13,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:13,404 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-11-06 23:03:13,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-06 23:03:13,407 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-11-06 23:03:13,407 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-11-06 23:03:13,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:13,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:13,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:13,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:13,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:13,623 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:13,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:13,623 INFO L85 PathProgramCache]: Analyzing trace with hash 301894701, now seen corresponding path program 1 times [2023-11-06 23:03:13,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:13,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799919818] [2023-11-06 23:03:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:13,625 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-06 23:03:13,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:13,626 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:13,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:13,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:03:13,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:13,926 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:13,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799919818] [2023-11-06 23:03:13,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799919818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:13,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:13,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:13,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980848399] [2023-11-06 23:03:13,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:13,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:13,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:13,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:13,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:13,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 346 [2023-11-06 23:03:13,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:13,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:13,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 346 [2023-11-06 23:03:13,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:15,573 INFO L124 PetriNetUnfolderBase]: 4917/7005 cut-off events. [2023-11-06 23:03:15,574 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-11-06 23:03:15,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14506 conditions, 7005 events. 4917/7005 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 37836 event pairs, 903 based on Foata normal form. 400/7124 useless extension candidates. Maximal degree in co-relation 14502. Up to 4867 conditions per place. [2023-11-06 23:03:15,615 INFO L140 encePairwiseOnDemand]: 339/346 looper letters, 41 selfloop transitions, 5 changer transitions 29/79 dead transitions. [2023-11-06 23:03:15,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 332 flow [2023-11-06 23:03:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:03:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:03:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 787 transitions. [2023-11-06 23:03:15,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4549132947976879 [2023-11-06 23:03:15,621 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 787 transitions. [2023-11-06 23:03:15,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 787 transitions. [2023-11-06 23:03:15,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:15,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 787 transitions. [2023-11-06 23:03:15,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.4) internal successors, (787), 5 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:15,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:15,634 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:15,634 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 787 transitions. [2023-11-06 23:03:15,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 332 flow [2023-11-06 23:03:15,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:15,645 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2023-11-06 23:03:15,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-11-06 23:03:15,646 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2023-11-06 23:03:15,646 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 113 flow [2023-11-06 23:03:15,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:15,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:15,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:15,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:15,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:15,868 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:15,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash -707238804, now seen corresponding path program 1 times [2023-11-06 23:03:15,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:15,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284989630] [2023-11-06 23:03:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:15,870 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-06 23:03:15,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:15,872 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:15,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:16,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:03:16,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:16,171 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:16,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:16,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284989630] [2023-11-06 23:03:16,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284989630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:16,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:16,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:16,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032667439] [2023-11-06 23:03:16,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:16,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:16,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:16,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:16,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:16,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 346 [2023-11-06 23:03:16,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:16,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:16,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 346 [2023-11-06 23:03:16,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:17,393 INFO L124 PetriNetUnfolderBase]: 2493/3765 cut-off events. [2023-11-06 23:03:17,394 INFO L125 PetriNetUnfolderBase]: For 1217/1217 co-relation queries the response was YES. [2023-11-06 23:03:17,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9861 conditions, 3765 events. 2493/3765 cut-off events. For 1217/1217 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 19915 event pairs, 519 based on Foata normal form. 256/3908 useless extension candidates. Maximal degree in co-relation 9854. Up to 1387 conditions per place. [2023-11-06 23:03:17,415 INFO L140 encePairwiseOnDemand]: 339/346 looper letters, 55 selfloop transitions, 9 changer transitions 29/97 dead transitions. [2023-11-06 23:03:17,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 97 transitions, 485 flow [2023-11-06 23:03:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:03:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:03:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 947 transitions. [2023-11-06 23:03:17,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45616570327552985 [2023-11-06 23:03:17,421 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 947 transitions. [2023-11-06 23:03:17,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 947 transitions. [2023-11-06 23:03:17,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:17,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 947 transitions. [2023-11-06 23:03:17,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:17,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:17,434 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:17,434 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 113 flow. Second operand 6 states and 947 transitions. [2023-11-06 23:03:17,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 97 transitions, 485 flow [2023-11-06 23:03:17,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 97 transitions, 478 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:17,449 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 178 flow [2023-11-06 23:03:17,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-11-06 23:03:17,450 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-11-06 23:03:17,451 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 178 flow [2023-11-06 23:03:17,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:17,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:17,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:17,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:17,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:17,664 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:17,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash 513905467, now seen corresponding path program 1 times [2023-11-06 23:03:17,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:17,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917427011] [2023-11-06 23:03:17,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:17,666 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-06 23:03:17,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:17,668 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:17,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:17,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 23:03:17,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:17,927 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:17,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:17,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917427011] [2023-11-06 23:03:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917427011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:17,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:17,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:03:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714348422] [2023-11-06 23:03:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:17,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:17,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:17,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 346 [2023-11-06 23:03:17,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:17,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:17,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 346 [2023-11-06 23:03:17,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:19,023 INFO L124 PetriNetUnfolderBase]: 1478/2290 cut-off events. [2023-11-06 23:03:19,023 INFO L125 PetriNetUnfolderBase]: For 2080/2080 co-relation queries the response was YES. [2023-11-06 23:03:19,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6683 conditions, 2290 events. 1478/2290 cut-off events. For 2080/2080 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 11412 event pairs, 457 based on Foata normal form. 88/2338 useless extension candidates. Maximal degree in co-relation 6674. Up to 792 conditions per place. [2023-11-06 23:03:19,038 INFO L140 encePairwiseOnDemand]: 339/346 looper letters, 67 selfloop transitions, 13 changer transitions 29/113 dead transitions. [2023-11-06 23:03:19,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 658 flow [2023-11-06 23:03:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:03:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:03:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1105 transitions. [2023-11-06 23:03:19,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45623451692815853 [2023-11-06 23:03:19,045 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1105 transitions. [2023-11-06 23:03:19,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1105 transitions. [2023-11-06 23:03:19,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:19,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1105 transitions. [2023-11-06 23:03:19,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.85714285714286) internal successors, (1105), 7 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:19,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:19,056 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:19,057 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 178 flow. Second operand 7 states and 1105 transitions. [2023-11-06 23:03:19,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 658 flow [2023-11-06 23:03:19,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 113 transitions, 596 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-06 23:03:19,088 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2023-11-06 23:03:19,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-11-06 23:03:19,089 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2023-11-06 23:03:19,090 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2023-11-06 23:03:19,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:19,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:19,091 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-06 23:03:19,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:19,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:19,317 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:19,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:19,318 INFO L85 PathProgramCache]: Analyzing trace with hash -128355138, now seen corresponding path program 1 times [2023-11-06 23:03:19,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:19,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850883620] [2023-11-06 23:03:19,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:19,319 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-06 23:03:19,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:19,321 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:19,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:19,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 23:03:19,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:19,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-06 23:03:19,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:19,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:19,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850883620] [2023-11-06 23:03:19,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850883620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:19,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:19,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:03:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153501726] [2023-11-06 23:03:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:19,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:03:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:19,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:03:19,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:03:19,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 346 [2023-11-06 23:03:19,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 145.0) internal successors, (1015), 7 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:19,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:19,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 346 [2023-11-06 23:03:19,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:20,650 INFO L124 PetriNetUnfolderBase]: 1290/1973 cut-off events. [2023-11-06 23:03:20,651 INFO L125 PetriNetUnfolderBase]: For 1731/1731 co-relation queries the response was YES. [2023-11-06 23:03:20,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5571 conditions, 1973 events. 1290/1973 cut-off events. For 1731/1731 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9637 event pairs, 453 based on Foata normal form. 15/1962 useless extension candidates. Maximal degree in co-relation 5561. Up to 792 conditions per place. [2023-11-06 23:03:20,664 INFO L140 encePairwiseOnDemand]: 339/346 looper letters, 63 selfloop transitions, 17 changer transitions 15/99 dead transitions. [2023-11-06 23:03:20,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 590 flow [2023-11-06 23:03:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:03:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:03:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1233 transitions. [2023-11-06 23:03:20,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4454479768786127 [2023-11-06 23:03:20,671 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1233 transitions. [2023-11-06 23:03:20,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1233 transitions. [2023-11-06 23:03:20,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:20,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1233 transitions. [2023-11-06 23:03:20,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 154.125) internal successors, (1233), 8 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:20,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 346.0) internal successors, (3114), 9 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:20,683 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 346.0) internal successors, (3114), 9 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:20,683 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 8 states and 1233 transitions. [2023-11-06 23:03:20,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 590 flow [2023-11-06 23:03:20,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 99 transitions, 528 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-06 23:03:20,713 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 222 flow [2023-11-06 23:03:20,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-11-06 23:03:20,715 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-11-06 23:03:20,715 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 222 flow [2023-11-06 23:03:20,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 145.0) internal successors, (1015), 7 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:20,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:20,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:20,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:20,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:20,929 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:20,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1922033576, now seen corresponding path program 1 times [2023-11-06 23:03:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672884364] [2023-11-06 23:03:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:20,931 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-06 23:03:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:20,932 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:20,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:21,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:03:21,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:21,229 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:21,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:21,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672884364] [2023-11-06 23:03:21,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672884364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:21,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:21,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:21,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161690346] [2023-11-06 23:03:21,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:21,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:21,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:21,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:21,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 346 [2023-11-06 23:03:21,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:21,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:21,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 346 [2023-11-06 23:03:21,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:21,962 INFO L124 PetriNetUnfolderBase]: 1800/2738 cut-off events. [2023-11-06 23:03:21,962 INFO L125 PetriNetUnfolderBase]: For 2612/2612 co-relation queries the response was YES. [2023-11-06 23:03:21,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7838 conditions, 2738 events. 1800/2738 cut-off events. For 2612/2612 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13729 event pairs, 459 based on Foata normal form. 0/2732 useless extension candidates. Maximal degree in co-relation 7827. Up to 1684 conditions per place. [2023-11-06 23:03:21,976 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 87 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2023-11-06 23:03:21,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 683 flow [2023-11-06 23:03:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:03:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 652 transitions. [2023-11-06 23:03:21,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47109826589595377 [2023-11-06 23:03:21,980 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 652 transitions. [2023-11-06 23:03:21,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 652 transitions. [2023-11-06 23:03:21,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:21,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 652 transitions. [2023-11-06 23:03:21,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:21,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:21,988 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:21,988 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 222 flow. Second operand 4 states and 652 transitions. [2023-11-06 23:03:21,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 683 flow [2023-11-06 23:03:22,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 92 transitions, 542 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-11-06 23:03:22,028 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 171 flow [2023-11-06 23:03:22,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-06 23:03:22,029 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2023-11-06 23:03:22,030 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 171 flow [2023-11-06 23:03:22,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:22,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:22,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:22,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:22,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:22,243 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:22,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1462147536, now seen corresponding path program 2 times [2023-11-06 23:03:22,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:22,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249181382] [2023-11-06 23:03:22,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:03:22,245 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-06 23:03:22,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:22,247 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:22,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:22,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:03:22,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:03:22,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:03:22,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:22,542 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:22,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:22,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249181382] [2023-11-06 23:03:22,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249181382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:22,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66724285] [2023-11-06 23:03:22,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:22,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:22,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 346 [2023-11-06 23:03:22,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:22,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:22,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 346 [2023-11-06 23:03:22,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:23,358 INFO L124 PetriNetUnfolderBase]: 2626/4085 cut-off events. [2023-11-06 23:03:23,358 INFO L125 PetriNetUnfolderBase]: For 2931/2931 co-relation queries the response was YES. [2023-11-06 23:03:23,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11004 conditions, 4085 events. 2626/4085 cut-off events. For 2931/2931 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 23101 event pairs, 491 based on Foata normal form. 1/4064 useless extension candidates. Maximal degree in co-relation 10994. Up to 2161 conditions per place. [2023-11-06 23:03:23,383 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 85 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-11-06 23:03:23,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 91 transitions, 551 flow [2023-11-06 23:03:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:03:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 650 transitions. [2023-11-06 23:03:23,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46965317919075145 [2023-11-06 23:03:23,388 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 650 transitions. [2023-11-06 23:03:23,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 650 transitions. [2023-11-06 23:03:23,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:23,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 650 transitions. [2023-11-06 23:03:23,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:23,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:23,395 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:23,396 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 171 flow. Second operand 4 states and 650 transitions. [2023-11-06 23:03:23,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 91 transitions, 551 flow [2023-11-06 23:03:23,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 548 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:03:23,457 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 183 flow [2023-11-06 23:03:23,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2023-11-06 23:03:23,459 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2023-11-06 23:03:23,459 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 183 flow [2023-11-06 23:03:23,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:23,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:23,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:23,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:23,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:23,673 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:23,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash -983564915, now seen corresponding path program 1 times [2023-11-06 23:03:23,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:23,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310177752] [2023-11-06 23:03:23,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:23,674 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-06 23:03:23,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:23,675 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:23,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:24,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 23:03:24,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:26,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:26,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:26,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310177752] [2023-11-06 23:03:26,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310177752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:26,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:26,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288077682] [2023-11-06 23:03:26,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:26,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:26,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:26,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:26,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 346 [2023-11-06 23:03:26,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:26,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:26,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 346 [2023-11-06 23:03:26,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:28,200 INFO L124 PetriNetUnfolderBase]: 2306/3606 cut-off events. [2023-11-06 23:03:28,200 INFO L125 PetriNetUnfolderBase]: For 3164/3164 co-relation queries the response was YES. [2023-11-06 23:03:28,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10156 conditions, 3606 events. 2306/3606 cut-off events. For 3164/3164 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 20613 event pairs, 194 based on Foata normal form. 4/3568 useless extension candidates. Maximal degree in co-relation 10144. Up to 3056 conditions per place. [2023-11-06 23:03:28,215 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 46 selfloop transitions, 4 changer transitions 17/71 dead transitions. [2023-11-06 23:03:28,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 71 transitions, 432 flow [2023-11-06 23:03:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:03:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:03:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions. [2023-11-06 23:03:28,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4007707129094412 [2023-11-06 23:03:28,221 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 832 transitions. [2023-11-06 23:03:28,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions. [2023-11-06 23:03:28,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:28,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions. [2023-11-06 23:03:28,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:28,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:28,231 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:28,231 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 183 flow. Second operand 6 states and 832 transitions. [2023-11-06 23:03:28,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 71 transitions, 432 flow [2023-11-06 23:03:28,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 430 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:03:28,272 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 176 flow [2023-11-06 23:03:28,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2023-11-06 23:03:28,273 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2023-11-06 23:03:28,273 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 176 flow [2023-11-06 23:03:28,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:28,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:28,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:28,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:28,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:28,476 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:28,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1933638496, now seen corresponding path program 3 times [2023-11-06 23:03:28,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:28,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051429648] [2023-11-06 23:03:28,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:03:28,477 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-06 23:03:28,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:28,478 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:28,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:28,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 23:03:28,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:03:28,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 23:03:28,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:29,274 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:29,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:29,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051429648] [2023-11-06 23:03:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051429648] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:29,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:03:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903272306] [2023-11-06 23:03:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:29,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:03:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:29,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:03:29,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:03:29,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 346 [2023-11-06 23:03:29,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 152.71428571428572) internal successors, (1069), 7 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:29,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:29,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 346 [2023-11-06 23:03:29,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:30,251 INFO L124 PetriNetUnfolderBase]: 2782/4275 cut-off events. [2023-11-06 23:03:30,251 INFO L125 PetriNetUnfolderBase]: For 2937/2940 co-relation queries the response was YES. [2023-11-06 23:03:30,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12053 conditions, 4275 events. 2782/4275 cut-off events. For 2937/2940 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 23466 event pairs, 1190 based on Foata normal form. 1/4203 useless extension candidates. Maximal degree in co-relation 12041. Up to 2687 conditions per place. [2023-11-06 23:03:30,272 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 52 selfloop transitions, 5 changer transitions 14/74 dead transitions. [2023-11-06 23:03:30,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 74 transitions, 462 flow [2023-11-06 23:03:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:03:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 644 transitions. [2023-11-06 23:03:30,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4653179190751445 [2023-11-06 23:03:30,276 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 644 transitions. [2023-11-06 23:03:30,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 644 transitions. [2023-11-06 23:03:30,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:30,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 644 transitions. [2023-11-06 23:03:30,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:30,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:30,283 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:30,283 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 176 flow. Second operand 4 states and 644 transitions. [2023-11-06 23:03:30,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 74 transitions, 462 flow [2023-11-06 23:03:30,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 446 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-11-06 23:03:30,361 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 193 flow [2023-11-06 23:03:30,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-11-06 23:03:30,362 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2023-11-06 23:03:30,362 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 193 flow [2023-11-06 23:03:30,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 152.71428571428572) internal successors, (1069), 7 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:30,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:30,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:30,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:30,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:30,564 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:30,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:30,564 INFO L85 PathProgramCache]: Analyzing trace with hash -164609856, now seen corresponding path program 4 times [2023-11-06 23:03:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:30,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952893379] [2023-11-06 23:03:30,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 23:03:30,566 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-06 23:03:30,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:30,567 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:30,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:30,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 23:03:30,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:03:30,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 23:03:30,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:31,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:31,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:03:31,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952893379] [2023-11-06 23:03:31,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952893379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:31,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:31,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:03:31,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946362308] [2023-11-06 23:03:31,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:31,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:03:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:03:31,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:03:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:03:31,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 346 [2023-11-06 23:03:31,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 193 flow. Second operand has 8 states, 8 states have (on average 152.25) internal successors, (1218), 8 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:31,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:31,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 346 [2023-11-06 23:03:31,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:33,069 INFO L124 PetriNetUnfolderBase]: 3054/4741 cut-off events. [2023-11-06 23:03:33,069 INFO L125 PetriNetUnfolderBase]: For 4260/4282 co-relation queries the response was YES. [2023-11-06 23:03:33,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14884 conditions, 4741 events. 3054/4741 cut-off events. For 4260/4282 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 27052 event pairs, 1214 based on Foata normal form. 15/4683 useless extension candidates. Maximal degree in co-relation 14873. Up to 2359 conditions per place. [2023-11-06 23:03:33,104 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 50 selfloop transitions, 5 changer transitions 18/76 dead transitions. [2023-11-06 23:03:33,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 480 flow [2023-11-06 23:03:33,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:03:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 644 transitions. [2023-11-06 23:03:33,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4653179190751445 [2023-11-06 23:03:33,109 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 644 transitions. [2023-11-06 23:03:33,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 644 transitions. [2023-11-06 23:03:33,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:33,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 644 transitions. [2023-11-06 23:03:33,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:33,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:33,118 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:33,118 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 193 flow. Second operand 4 states and 644 transitions. [2023-11-06 23:03:33,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 480 flow [2023-11-06 23:03:33,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:33,227 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 211 flow [2023-11-06 23:03:33,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-11-06 23:03:33,228 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-11-06 23:03:33,228 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 211 flow [2023-11-06 23:03:33,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 152.25) internal successors, (1218), 8 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:33,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:33,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:33,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:33,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:33,430 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2023-11-06 23:03:33,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash -59437560, now seen corresponding path program 5 times [2023-11-06 23:03:33,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:03:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48822074] [2023-11-06 23:03:33,432 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 23:03:33,432 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-06 23:03:33,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:03:33,433 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:33,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:33,722 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:03:33,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 23:03:33,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:03:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:03:34,108 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 23:03:34,109 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:03:34,110 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2023-11-06 23:03:34,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (16 of 18 remaining) [2023-11-06 23:03:34,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (15 of 18 remaining) [2023-11-06 23:03:34,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2023-11-06 23:03:34,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2023-11-06 23:03:34,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2023-11-06 23:03:34,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2023-11-06 23:03:34,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2023-11-06 23:03:34,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2023-11-06 23:03:34,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2023-11-06 23:03:34,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2023-11-06 23:03:34,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (6 of 18 remaining) [2023-11-06 23:03:34,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 18 remaining) [2023-11-06 23:03:34,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 18 remaining) [2023-11-06 23:03:34,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 18 remaining) [2023-11-06 23:03:34,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 18 remaining) [2023-11-06 23:03:34,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 18 remaining) [2023-11-06 23:03:34,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 18 remaining) [2023-11-06 23:03:34,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:34,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/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-06 23:03:34,335 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:34,341 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:03:34,341 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:03:34,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:03:34 BasicIcfg [2023-11-06 23:03:34,542 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:03:34,543 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:03:34,543 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:03:34,544 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:03:34,544 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:02:37" (3/4) ... [2023-11-06 23:03:34,547 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:03:34,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:03:34,549 INFO L158 Benchmark]: Toolchain (without parser) took 60066.54ms. Allocated memory was 92.3MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 67.2MB in the beginning and 3.6GB in the end (delta: -3.6GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-11-06 23:03:34,550 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 67.1MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:03:34,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1014.67ms. Allocated memory is still 92.3MB. Free memory was 67.0MB in the beginning and 58.1MB in the end (delta: 9.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-11-06 23:03:34,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.72ms. Allocated memory is still 92.3MB. Free memory was 58.1MB in the beginning and 54.3MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:03:34,552 INFO L158 Benchmark]: Boogie Preprocessor took 97.81ms. Allocated memory is still 92.3MB. Free memory was 54.3MB in the beginning and 51.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:03:34,552 INFO L158 Benchmark]: RCFGBuilder took 1489.23ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 51.2MB in the beginning and 73.2MB in the end (delta: -22.0MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2023-11-06 23:03:34,555 INFO L158 Benchmark]: TraceAbstraction took 57340.23ms. Allocated memory was 111.1MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 72.6MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2023-11-06 23:03:34,556 INFO L158 Benchmark]: Witness Printer took 5.30ms. Allocated memory is still 5.8GB. Free memory was 3.7GB in the beginning and 3.6GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:03:34,560 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.28ms. Allocated memory is still 67.1MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1014.67ms. Allocated memory is still 92.3MB. Free memory was 67.0MB in the beginning and 58.1MB in the end (delta: 9.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.72ms. Allocated memory is still 92.3MB. Free memory was 58.1MB in the beginning and 54.3MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.81ms. Allocated memory is still 92.3MB. Free memory was 54.3MB in the beginning and 51.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1489.23ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 51.2MB in the beginning and 73.2MB in the end (delta: -22.0MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 57340.23ms. Allocated memory was 111.1MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 72.6MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 5.30ms. Allocated memory is still 5.8GB. Free memory was 3.7GB in the beginning and 3.6GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.7s, 178 PlacesBefore, 54 PlacesAfterwards, 168 TransitionsBefore, 41 TransitionsAfterwards, 4344 CoEnabledTransitionPairs, 7 FixpointIterations, 74 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 174 TotalNumberOfCompositions, 13161 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5260, independent: 4985, independent conditional: 0, independent unconditional: 4985, dependent: 275, dependent conditional: 0, dependent unconditional: 275, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2308, independent: 2242, independent conditional: 0, independent unconditional: 2242, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5260, independent: 2743, independent conditional: 0, independent unconditional: 2743, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 2308, unknown conditional: 0, unknown unconditional: 2308] , Statistics on independence cache: Total cache size (in pairs): 197, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t625; [L921] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t625, ((void *)0), P0, ((void *)0))=0, t625={11:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L922] 0 pthread_t t626; [L923] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t626, ((void *)0), P1, ((void *)0))=1, t625={11:0}, t626={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L924] 0 pthread_t t627; [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L794] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L794] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L925] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t627, ((void *)0), P2, ((void *)0))=2, t625={11:0}, t626={15:0}, t627={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L842] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L926] 0 pthread_t t628; [L927] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t628, ((void *)0), P3, ((void *)0))=3, t625={11:0}, t626={15:0}, t627={7:0}, t628={-2147483637:0}, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L865] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L865] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L890] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L822] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L893] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L898] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 2 return 0; [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 3 return 0; [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L907] 4 return 0; [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L931] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L931] RET 0 assume_abort_if_not(main$tmp_guard0) [L933] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L938] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625={11:0}, t626={15:0}, t627={7:0}, t628={-2147483637:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L973] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix023_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={10:9}, \read(__PRETTY_FUNCTION__)={8:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 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: 918]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 927]: 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: 923]: 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: 921]: 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: 925]: 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, 210 locations, 18 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: 56.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 23.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 503 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2217 IncrementalHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 52 mSDtfsCounter, 2217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=6, InterpolantAutomatonStates: 56, 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.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 217 ConstructedInterpolants, 19 QuantifiedInterpolants, 3499 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2402 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-06 23:03:34,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_574260c6-3ab6-4039-ba18-533c6d3a1241/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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