./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9565dcbef2b519c6326563c41ab6633c2e0b59b7d9ee2c8626de0cd3767b77b1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:42:26,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:42:26,864 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:42:26,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:42:26,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:42:26,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:42:26,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:42:26,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:42:26,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:42:26,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:42:26,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:42:26,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:42:26,908 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:42:26,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:42:26,910 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:42:26,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:42:26,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:42:26,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:42:26,916 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:42:26,917 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:42:26,920 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:42:26,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:42:26,923 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:42:26,924 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:42:26,925 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:42:26,926 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:42:26,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:42:26,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:42:26,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:42:26,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:42:26,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:42:26,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:42:26,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:42:26,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:42:26,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:42:26,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:42:26,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:42:26,931 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:42:26,932 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_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9565dcbef2b519c6326563c41ab6633c2e0b59b7d9ee2c8626de0cd3767b77b1 [2023-11-19 07:42:27,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:42:27,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:42:27,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:42:27,246 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:42:27,247 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:42:27,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:42:30,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:42:30,718 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:42:30,719 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/sv-benchmarks/c/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:42:30,740 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/data/76436f5fc/95efc4114d164589a6989bc68aad74a8/FLAGd96925ad1 [2023-11-19 07:42:30,756 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/data/76436f5fc/95efc4114d164589a6989bc68aad74a8 [2023-11-19 07:42:30,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:42:30,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:42:30,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:42:30,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:42:30,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:42:30,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:30" (1/1) ... [2023-11-19 07:42:30,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3446855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:30, skipping insertion in model container [2023-11-19 07:42:30,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:42:30" (1/1) ... [2023-11-19 07:42:30,840 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:42:31,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:42:31,363 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:42:31,460 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:42:31,511 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:42:31,512 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:42:31,520 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:42:31,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31 WrapperNode [2023-11-19 07:42:31,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:42:31,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:42:31,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:42:31,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:42:31,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,608 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 165 [2023-11-19 07:42:31,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:42:31,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:42:31,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:42:31,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:42:31,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:42:31,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:42:31,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:42:31,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:42:31,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (1/1) ... [2023-11-19 07:42:31,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:42:31,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:42:31,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:42:31,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5388d12c-8bc3-4600-9fb2-dcaf349c69db/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:42:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:42:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:42:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:42:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:42:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:42:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:42:31,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:42:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:42:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:42:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:42:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:42:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:42:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:42:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:42:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:42:31,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:42:31,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:42:31,800 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:42:31,956 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:42:31,958 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:42:32,400 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:42:32,619 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:42:32,620 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:42:32,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:32 BoogieIcfgContainer [2023-11-19 07:42:32,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:42:32,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:42:32,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:42:32,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:42:32,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:42:30" (1/3) ... [2023-11-19 07:42:32,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d059d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:32, skipping insertion in model container [2023-11-19 07:42:32,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:42:31" (2/3) ... [2023-11-19 07:42:32,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d059d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:42:32, skipping insertion in model container [2023-11-19 07:42:32,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:42:32" (3/3) ... [2023-11-19 07:42:32,641 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i [2023-11-19 07:42:32,660 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:42:32,660 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 07:42:32,661 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:42:32,730 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:42:32,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 150 transitions, 316 flow [2023-11-19 07:42:32,841 INFO L124 PetriNetUnfolderBase]: 4/146 cut-off events. [2023-11-19 07:42:32,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:42:32,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 4/146 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/131 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-19 07:42:32,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 150 transitions, 316 flow [2023-11-19 07:42:32,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 146 transitions, 304 flow [2023-11-19 07:42:32,860 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:42:32,877 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 146 transitions, 304 flow [2023-11-19 07:42:32,880 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 146 transitions, 304 flow [2023-11-19 07:42:32,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 146 transitions, 304 flow [2023-11-19 07:42:32,919 INFO L124 PetriNetUnfolderBase]: 4/146 cut-off events. [2023-11-19 07:42:32,920 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:42:32,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 4/146 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/131 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-19 07:42:32,925 INFO L119 LiptonReduction]: Number of co-enabled transitions 4176 [2023-11-19 07:42:38,513 INFO L134 LiptonReduction]: Checked pairs total: 10336 [2023-11-19 07:42:38,514 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-11-19 07:42:38,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:42:38,540 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;@4f49753f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:42:38,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 07:42:38,542 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:42:38,542 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:42:38,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:42:38,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:38,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:42:38,544 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:42:38,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:38,550 INFO L85 PathProgramCache]: Analyzing trace with hash 643, now seen corresponding path program 1 times [2023-11-19 07:42:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:38,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769031608] [2023-11-19 07:42:38,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:42:38,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:38,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769031608] [2023-11-19 07:42:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769031608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:38,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:38,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:42:38,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714462388] [2023-11-19 07:42:38,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:38,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:42:38,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:38,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:42:38,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:42:38,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 294 [2023-11-19 07:42:38,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:38,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:38,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 294 [2023-11-19 07:42:38,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:40,626 INFO L124 PetriNetUnfolderBase]: 6935/9648 cut-off events. [2023-11-19 07:42:40,626 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-19 07:42:40,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19232 conditions, 9648 events. 6935/9648 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 51249 event pairs, 6935 based on Foata normal form. 0/8332 useless extension candidates. Maximal degree in co-relation 19220. Up to 9377 conditions per place. [2023-11-19 07:42:40,714 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-19 07:42:40,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-11-19 07:42:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:42:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:42:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 304 transitions. [2023-11-19 07:42:40,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170068027210885 [2023-11-19 07:42:40,735 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 304 transitions. [2023-11-19 07:42:40,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 304 transitions. [2023-11-19 07:42:40,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:40,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 304 transitions. [2023-11-19 07:42:40,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:40,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:40,754 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:40,756 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 304 transitions. [2023-11-19 07:42:40,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-11-19 07:42:40,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:42:40,767 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-19 07:42:40,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-19 07:42:40,775 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-19 07:42:40,776 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-19 07:42:40,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:40,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:40,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:40,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:42:40,777 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:42:40,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:40,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1243009419, now seen corresponding path program 1 times [2023-11-19 07:42:40,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:40,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974673520] [2023-11-19 07:42:40,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:42:41,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:41,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974673520] [2023-11-19 07:42:41,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974673520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:41,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:41,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:42:41,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380731375] [2023-11-19 07:42:41,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:41,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:42:41,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:41,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:42:41,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:42:41,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 294 [2023-11-19 07:42:41,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:41,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:41,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 294 [2023-11-19 07:42:41,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:42,562 INFO L124 PetriNetUnfolderBase]: 5463/7748 cut-off events. [2023-11-19 07:42:42,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:42:42,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15345 conditions, 7748 events. 5463/7748 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 41492 event pairs, 1495 based on Foata normal form. 0/7184 useless extension candidates. Maximal degree in co-relation 15342. Up to 5857 conditions per place. [2023-11-19 07:42:42,639 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 39 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-11-19 07:42:42,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 190 flow [2023-11-19 07:42:42,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:42:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:42:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-11-19 07:42:42,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5022675736961452 [2023-11-19 07:42:42,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-11-19 07:42:42,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-11-19 07:42:42,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:42,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-11-19 07:42:42,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:42,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:42,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:42,657 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 443 transitions. [2023-11-19 07:42:42,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 190 flow [2023-11-19 07:42:42,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:42:42,661 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-19 07:42:42,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, 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=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-19 07:42:42,663 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-19 07:42:42,664 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-19 07:42:42,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:42,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:42,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:42,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:42:42,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:42:42,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:42,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1991374068, now seen corresponding path program 1 times [2023-11-19 07:42:42,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:42,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084943851] [2023-11-19 07:42:42,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:42,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:42:43,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:43,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084943851] [2023-11-19 07:42:43,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084943851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:43,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:43,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:42:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481018009] [2023-11-19 07:42:43,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:43,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:42:43,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:43,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:42:43,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:42:43,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 294 [2023-11-19 07:42:43,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:43,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:43,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 294 [2023-11-19 07:42:43,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:44,991 INFO L124 PetriNetUnfolderBase]: 3927/5652 cut-off events. [2023-11-19 07:42:44,991 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2023-11-19 07:42:45,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11555 conditions, 5652 events. 3927/5652 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 29469 event pairs, 768 based on Foata normal form. 0/5524 useless extension candidates. Maximal degree in co-relation 11551. Up to 5136 conditions per place. [2023-11-19 07:42:45,042 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 38 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-11-19 07:42:45,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 190 flow [2023-11-19 07:42:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:42:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:42:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2023-11-19 07:42:45,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121315192743764 [2023-11-19 07:42:45,047 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 727 transitions. [2023-11-19 07:42:45,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 727 transitions. [2023-11-19 07:42:45,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:45,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 727 transitions. [2023-11-19 07:42:45,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:45,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:45,058 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:45,059 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 6 states and 727 transitions. [2023-11-19 07:42:45,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 190 flow [2023-11-19 07:42:45,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:42:45,065 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 72 flow [2023-11-19 07:42:45,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-11-19 07:42:45,066 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-11-19 07:42:45,066 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 72 flow [2023-11-19 07:42:45,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:45,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:45,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:45,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:42:45,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:42:45,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1991374028, now seen corresponding path program 1 times [2023-11-19 07:42:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284485082] [2023-11-19 07:42:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:42:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:45,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284485082] [2023-11-19 07:42:45,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284485082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:45,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:45,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:42:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980928775] [2023-11-19 07:42:45,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:45,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:42:45,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:45,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:42:45,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:42:46,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 294 [2023-11-19 07:42:46,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:46,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:46,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 294 [2023-11-19 07:42:46,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:49,238 INFO L124 PetriNetUnfolderBase]: 16251/22152 cut-off events. [2023-11-19 07:42:49,238 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2023-11-19 07:42:49,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44845 conditions, 22152 events. 16251/22152 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 119012 event pairs, 1531 based on Foata normal form. 940/23092 useless extension candidates. Maximal degree in co-relation 44841. Up to 13313 conditions per place. [2023-11-19 07:42:49,380 INFO L140 encePairwiseOnDemand]: 279/294 looper letters, 54 selfloop transitions, 14 changer transitions 45/113 dead transitions. [2023-11-19 07:42:49,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 113 transitions, 484 flow [2023-11-19 07:42:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:42:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:42:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 935 transitions. [2023-11-19 07:42:49,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4543245869776482 [2023-11-19 07:42:49,387 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 935 transitions. [2023-11-19 07:42:49,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 935 transitions. [2023-11-19 07:42:49,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:49,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 935 transitions. [2023-11-19 07:42:49,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.57142857142858) internal successors, (935), 7 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:49,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:49,401 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:49,401 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 72 flow. Second operand 7 states and 935 transitions. [2023-11-19 07:42:49,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 113 transitions, 484 flow [2023-11-19 07:42:49,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 113 transitions, 471 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:42:49,405 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 201 flow [2023-11-19 07:42:49,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-19 07:42:49,407 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-11-19 07:42:49,408 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 201 flow [2023-11-19 07:42:49,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:49,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:49,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:49,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:42:49,409 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:42:49,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:49,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1603042572, now seen corresponding path program 1 times [2023-11-19 07:42:49,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:49,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620706094] [2023-11-19 07:42:49,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:49,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:42:50,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:50,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620706094] [2023-11-19 07:42:50,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620706094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:50,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:50,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:42:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114160005] [2023-11-19 07:42:50,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:50,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:42:50,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:50,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:42:50,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:42:50,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 294 [2023-11-19 07:42:50,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:50,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:50,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 294 [2023-11-19 07:42:50,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:52,815 INFO L124 PetriNetUnfolderBase]: 13463/18764 cut-off events. [2023-11-19 07:42:52,815 INFO L125 PetriNetUnfolderBase]: For 18751/18815 co-relation queries the response was YES. [2023-11-19 07:42:52,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61043 conditions, 18764 events. 13463/18764 cut-off events. For 18751/18815 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 100879 event pairs, 2479 based on Foata normal form. 948/19708 useless extension candidates. Maximal degree in co-relation 61034. Up to 8795 conditions per place. [2023-11-19 07:42:52,964 INFO L140 encePairwiseOnDemand]: 281/294 looper letters, 59 selfloop transitions, 18 changer transitions 47/126 dead transitions. [2023-11-19 07:42:52,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 126 transitions, 851 flow [2023-11-19 07:42:52,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:42:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:42:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2023-11-19 07:42:52,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4484936831875607 [2023-11-19 07:42:52,969 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2023-11-19 07:42:52,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2023-11-19 07:42:52,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:52,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2023-11-19 07:42:52,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:52,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:52,980 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:52,980 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 201 flow. Second operand 7 states and 923 transitions. [2023-11-19 07:42:52,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 126 transitions, 851 flow [2023-11-19 07:42:52,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 126 transitions, 851 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:42:53,002 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 415 flow [2023-11-19 07:42:53,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=415, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2023-11-19 07:42:53,005 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-11-19 07:42:53,005 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 415 flow [2023-11-19 07:42:53,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:53,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:53,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:53,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:42:53,007 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:42:53,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1438887229, now seen corresponding path program 1 times [2023-11-19 07:42:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:53,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737934639] [2023-11-19 07:42:53,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:53,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:42:53,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:53,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737934639] [2023-11-19 07:42:53,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737934639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:53,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:53,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:42:53,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827649162] [2023-11-19 07:42:53,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:53,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:42:53,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:53,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:42:53,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:42:53,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 294 [2023-11-19 07:42:53,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:53,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:53,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 294 [2023-11-19 07:42:53,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:54,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][64], [P2Thread1of1ForFork3InUse, 162#true, 107#L794true, 41#P1EXITtrue, 192#true, Black: 200#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 194#(= ~__unbuffered_p3_EAX~0 0), 152#L827true, Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), Black: 198#(and (= ~__unbuffered_p3_EAX~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 196#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 5#L851-3true, 208#true, 90#P0EXITtrue, Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 176#true, P1Thread1of1ForFork0InUse, Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork1InUse, Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:42:54,488 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-19 07:42:54,488 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:42:54,488 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:42:54,488 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:42:54,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][64], [P2Thread1of1ForFork3InUse, 18#L855true, 162#true, 41#P1EXITtrue, 107#L794true, 192#true, Black: 200#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 194#(= ~__unbuffered_p3_EAX~0 0), 152#L827true, Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), Black: 198#(and (= ~__unbuffered_p3_EAX~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 196#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 208#true, 90#P0EXITtrue, Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 176#true, Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:42:54,836 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:42:54,836 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:54,836 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:54,836 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:54,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L855-->L862: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd0~0_90 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_86 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_165 256) 0)))) (let ((.cse4 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_147 256) 0)) .cse2)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_166 256) 0))))) (and (= v_~y~0_89 (ite .cse0 v_~y$w_buff0~0_87 (ite .cse1 v_~y$w_buff1~0_72 v_~y~0_90))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) .cse2) (and (not (= (mod v_~y$r_buff0_thd0~0_85 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_90) v_~y$r_buff1_thd0~0_89) (= v_~y$r_buff0_thd0~0_85 (ite .cse4 0 v_~y$r_buff0_thd0~0_86)) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17| 0)) (= (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_147) v_~y$w_buff1_used~0_146) (= v_~y$w_buff0_used~0_165 (ite .cse0 0 v_~y$w_buff0_used~0_166))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_166, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_87, ~y~0=v_~y~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_90, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_147, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_87, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|, ~y~0=v_~y~0_89, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][48], [P2Thread1of1ForFork3InUse, 162#true, 41#P1EXITtrue, 107#L794true, 192#true, Black: 200#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 194#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), Black: 198#(and (= ~__unbuffered_p3_EAX~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 196#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 208#true, 90#P0EXITtrue, Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 176#true, Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), P1Thread1of1ForFork0InUse, 126#L820true, Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork1InUse, 92#L862true, Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:42:54,840 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:42:54,840 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:54,840 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:54,841 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:55,592 INFO L124 PetriNetUnfolderBase]: 10782/15461 cut-off events. [2023-11-19 07:42:55,592 INFO L125 PetriNetUnfolderBase]: For 49122/50055 co-relation queries the response was YES. [2023-11-19 07:42:55,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61986 conditions, 15461 events. 10782/15461 cut-off events. For 49122/50055 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 88890 event pairs, 3224 based on Foata normal form. 1057/16079 useless extension candidates. Maximal degree in co-relation 61971. Up to 11930 conditions per place. [2023-11-19 07:42:55,770 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 65 selfloop transitions, 8 changer transitions 27/111 dead transitions. [2023-11-19 07:42:55,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 111 transitions, 976 flow [2023-11-19 07:42:55,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:42:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:42:55,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2023-11-19 07:42:55,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48027210884353744 [2023-11-19 07:42:55,777 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 706 transitions. [2023-11-19 07:42:55,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 706 transitions. [2023-11-19 07:42:55,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:55,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 706 transitions. [2023-11-19 07:42:55,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:55,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:55,788 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:55,788 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 415 flow. Second operand 5 states and 706 transitions. [2023-11-19 07:42:55,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 111 transitions, 976 flow [2023-11-19 07:42:55,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 967 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-19 07:42:55,883 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 524 flow [2023-11-19 07:42:55,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=524, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2023-11-19 07:42:55,887 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2023-11-19 07:42:55,891 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 524 flow [2023-11-19 07:42:55,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:55,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:55,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:55,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:42:55,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:42:55,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash -569040902, now seen corresponding path program 1 times [2023-11-19 07:42:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422906585] [2023-11-19 07:42:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:42:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:56,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422906585] [2023-11-19 07:42:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422906585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:56,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:42:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945639839] [2023-11-19 07:42:56,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:56,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:42:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:56,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:42:56,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:42:56,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 294 [2023-11-19 07:42:56,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 524 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:56,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:56,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 294 [2023-11-19 07:42:56,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:42:57,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][79], [107#L794true, 192#true, Black: 200#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 194#(= ~__unbuffered_p3_EAX~0 0), 152#L827true, Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 218#true, 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), Black: 196#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 208#true, 90#P0EXITtrue, Black: 211#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 162#true, 41#P1EXITtrue, 5#L851-3true, Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 176#true, Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:42:57,791 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-19 07:42:57,791 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:42:57,791 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:42:57,791 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:42:57,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][79], [18#L855true, 107#L794true, 192#true, Black: 200#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 194#(= ~__unbuffered_p3_EAX~0 0), 152#L827true, Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 218#true, 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), Black: 196#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 208#true, 90#P0EXITtrue, Black: 211#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 162#true, 41#P1EXITtrue, Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 176#true, Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:42:57,990 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:42:57,990 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:57,990 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:57,990 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:57,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L855-->L862: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd0~0_90 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_86 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_165 256) 0)))) (let ((.cse4 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_147 256) 0)) .cse2)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_166 256) 0))))) (and (= v_~y~0_89 (ite .cse0 v_~y$w_buff0~0_87 (ite .cse1 v_~y$w_buff1~0_72 v_~y~0_90))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) .cse2) (and (not (= (mod v_~y$r_buff0_thd0~0_85 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_90) v_~y$r_buff1_thd0~0_89) (= v_~y$r_buff0_thd0~0_85 (ite .cse4 0 v_~y$r_buff0_thd0~0_86)) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17| 0)) (= (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_147) v_~y$w_buff1_used~0_146) (= v_~y$w_buff0_used~0_165 (ite .cse0 0 v_~y$w_buff0_used~0_166))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_166, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_87, ~y~0=v_~y~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_90, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_147, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_87, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|, ~y~0=v_~y~0_89, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][58], [107#L794true, 192#true, Black: 200#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 194#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 218#true, 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), Black: 196#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 208#true, 90#P0EXITtrue, Black: 211#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 126#L820true, 92#L862true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 162#true, 41#P1EXITtrue, Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 176#true, Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:42:57,991 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:42:57,991 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:57,992 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:57,992 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:42:58,714 INFO L124 PetriNetUnfolderBase]: 10946/15579 cut-off events. [2023-11-19 07:42:58,714 INFO L125 PetriNetUnfolderBase]: For 51429/52117 co-relation queries the response was YES. [2023-11-19 07:42:58,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65670 conditions, 15579 events. 10946/15579 cut-off events. For 51429/52117 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 86199 event pairs, 2273 based on Foata normal form. 776/16102 useless extension candidates. Maximal degree in co-relation 65652. Up to 10921 conditions per place. [2023-11-19 07:42:58,915 INFO L140 encePairwiseOnDemand]: 286/294 looper letters, 84 selfloop transitions, 19 changer transitions 34/146 dead transitions. [2023-11-19 07:42:58,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 146 transitions, 1390 flow [2023-11-19 07:42:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:42:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:42:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 985 transitions. [2023-11-19 07:42:58,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47862001943634597 [2023-11-19 07:42:58,922 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 985 transitions. [2023-11-19 07:42:58,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 985 transitions. [2023-11-19 07:42:58,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:42:58,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 985 transitions. [2023-11-19 07:42:58,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.71428571428572) internal successors, (985), 7 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:58,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:58,936 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:58,936 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 524 flow. Second operand 7 states and 985 transitions. [2023-11-19 07:42:58,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 146 transitions, 1390 flow [2023-11-19 07:42:59,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 146 transitions, 1340 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-11-19 07:42:59,130 INFO L231 Difference]: Finished difference. Result has 66 places, 74 transitions, 661 flow [2023-11-19 07:42:59,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=661, PETRI_PLACES=66, PETRI_TRANSITIONS=74} [2023-11-19 07:42:59,132 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2023-11-19 07:42:59,132 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 661 flow [2023-11-19 07:42:59,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:59,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:42:59,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:42:59,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:42:59,138 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:42:59,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:42:59,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1044811912, now seen corresponding path program 2 times [2023-11-19 07:42:59,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:42:59,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019066469] [2023-11-19 07:42:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:42:59,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:42:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:42:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:42:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:42:59,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019066469] [2023-11-19 07:42:59,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019066469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:42:59,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:42:59,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:42:59,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157229444] [2023-11-19 07:42:59,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:42:59,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:42:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:42:59,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:42:59,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:42:59,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 294 [2023-11-19 07:42:59,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 661 flow. Second operand has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:42:59,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:42:59,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 294 [2023-11-19 07:42:59,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:02,340 INFO L124 PetriNetUnfolderBase]: 12856/17671 cut-off events. [2023-11-19 07:43:02,340 INFO L125 PetriNetUnfolderBase]: For 71129/71129 co-relation queries the response was YES. [2023-11-19 07:43:02,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79662 conditions, 17671 events. 12856/17671 cut-off events. For 71129/71129 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 89917 event pairs, 1652 based on Foata normal form. 412/18083 useless extension candidates. Maximal degree in co-relation 79643. Up to 13881 conditions per place. [2023-11-19 07:43:02,489 INFO L140 encePairwiseOnDemand]: 282/294 looper letters, 102 selfloop transitions, 48 changer transitions 51/201 dead transitions. [2023-11-19 07:43:02,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 201 transitions, 2070 flow [2023-11-19 07:43:02,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:43:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 07:43:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1194 transitions. [2023-11-19 07:43:02,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512471655328798 [2023-11-19 07:43:02,496 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1194 transitions. [2023-11-19 07:43:02,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1194 transitions. [2023-11-19 07:43:02,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:02,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1194 transitions. [2023-11-19 07:43:02,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 132.66666666666666) internal successors, (1194), 9 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:02,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:02,508 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:02,508 INFO L175 Difference]: Start difference. First operand has 66 places, 74 transitions, 661 flow. Second operand 9 states and 1194 transitions. [2023-11-19 07:43:02,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 201 transitions, 2070 flow [2023-11-19 07:43:02,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 201 transitions, 2039 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-19 07:43:02,673 INFO L231 Difference]: Finished difference. Result has 75 places, 102 transitions, 1176 flow [2023-11-19 07:43:02,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1176, PETRI_PLACES=75, PETRI_TRANSITIONS=102} [2023-11-19 07:43:02,674 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-11-19 07:43:02,674 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 102 transitions, 1176 flow [2023-11-19 07:43:02,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:02,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:02,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:02,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:43:02,675 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:43:02,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash 253157588, now seen corresponding path program 1 times [2023-11-19 07:43:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:02,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289249548] [2023-11-19 07:43:02,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:03,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:03,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289249548] [2023-11-19 07:43:03,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289249548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:03,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:03,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:43:03,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120584363] [2023-11-19 07:43:03,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:03,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:43:03,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:03,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:43:03,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:43:03,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 294 [2023-11-19 07:43:03,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 102 transitions, 1176 flow. Second operand has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:03,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:03,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 294 [2023-11-19 07:43:03,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:04,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][122], [107#L794true, 192#true, Black: 194#(= ~__unbuffered_p3_EAX~0 0), 152#L827true, Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), 90#P0EXITtrue, Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 232#true, P2Thread1of1ForFork3InUse, Black: 224#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 162#true, Black: 221#(and (= ~y$w_buff0_used~0 0) (= ~y~0 1)), 41#P1EXITtrue, 5#L851-3true, 255#true, Black: 235#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 242#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 244#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 234#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), 176#true, Black: 238#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 246#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:04,871 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-19 07:43:04,871 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:43:04,871 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:43:04,871 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:43:05,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][122], [18#L855true, 107#L794true, 192#true, Black: 194#(= ~__unbuffered_p3_EAX~0 0), 152#L827true, Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), 90#P0EXITtrue, Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 232#true, P2Thread1of1ForFork3InUse, Black: 224#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 162#true, Black: 221#(and (= ~y$w_buff0_used~0 0) (= ~y~0 1)), 41#P1EXITtrue, 255#true, Black: 235#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 242#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 244#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 176#true, Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 234#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 238#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 246#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:05,093 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:43:05,094 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:05,094 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:05,094 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:05,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L855-->L862: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd0~0_90 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_86 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_165 256) 0)))) (let ((.cse4 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_147 256) 0)) .cse2)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_166 256) 0))))) (and (= v_~y~0_89 (ite .cse0 v_~y$w_buff0~0_87 (ite .cse1 v_~y$w_buff1~0_72 v_~y~0_90))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) .cse2) (and (not (= (mod v_~y$r_buff0_thd0~0_85 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_90) v_~y$r_buff1_thd0~0_89) (= v_~y$r_buff0_thd0~0_85 (ite .cse4 0 v_~y$r_buff0_thd0~0_86)) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17| 0)) (= (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_147) v_~y$w_buff1_used~0_146) (= v_~y$w_buff0_used~0_165 (ite .cse0 0 v_~y$w_buff0_used~0_166))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_166, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_87, ~y~0=v_~y~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_90, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_147, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_87, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|, ~y~0=v_~y~0_89, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][90], [107#L794true, 192#true, Black: 194#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), 90#P0EXITtrue, Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 126#L820true, P3Thread1of1ForFork1InUse, 92#L862true, 232#true, P2Thread1of1ForFork3InUse, Black: 224#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 162#true, Black: 221#(and (= ~y$w_buff0_used~0 0) (= ~y~0 1)), 41#P1EXITtrue, 255#true, Black: 235#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 242#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 244#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 176#true, Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 234#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 238#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 246#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:05,094 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:43:05,094 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:05,094 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:05,095 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:05,687 INFO L124 PetriNetUnfolderBase]: 11483/16350 cut-off events. [2023-11-19 07:43:05,687 INFO L125 PetriNetUnfolderBase]: For 125137/125808 co-relation queries the response was YES. [2023-11-19 07:43:05,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87623 conditions, 16350 events. 11483/16350 cut-off events. For 125137/125808 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 91928 event pairs, 2412 based on Foata normal form. 889/16859 useless extension candidates. Maximal degree in co-relation 87599. Up to 11714 conditions per place. [2023-11-19 07:43:05,837 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 121 selfloop transitions, 12 changer transitions 29/175 dead transitions. [2023-11-19 07:43:05,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 175 transitions, 2186 flow [2023-11-19 07:43:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:43:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:43:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 849 transitions. [2023-11-19 07:43:05,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4812925170068027 [2023-11-19 07:43:05,840 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 849 transitions. [2023-11-19 07:43:05,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 849 transitions. [2023-11-19 07:43:05,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:05,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 849 transitions. [2023-11-19 07:43:05,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:05,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:05,848 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:05,848 INFO L175 Difference]: Start difference. First operand has 75 places, 102 transitions, 1176 flow. Second operand 6 states and 849 transitions. [2023-11-19 07:43:05,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 175 transitions, 2186 flow [2023-11-19 07:43:06,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 175 transitions, 2150 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-11-19 07:43:06,036 INFO L231 Difference]: Finished difference. Result has 76 places, 108 transitions, 1281 flow [2023-11-19 07:43:06,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1281, PETRI_PLACES=76, PETRI_TRANSITIONS=108} [2023-11-19 07:43:06,037 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2023-11-19 07:43:06,037 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 108 transitions, 1281 flow [2023-11-19 07:43:06,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:06,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:06,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:06,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:43:06,039 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:43:06,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1478338503, now seen corresponding path program 1 times [2023-11-19 07:43:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:06,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637656294] [2023-11-19 07:43:06,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:06,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:06,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637656294] [2023-11-19 07:43:06,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637656294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:06,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:06,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:43:06,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753349444] [2023-11-19 07:43:06,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:06,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:43:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:06,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:43:06,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:43:06,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 294 [2023-11-19 07:43:06,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 108 transitions, 1281 flow. Second operand has 7 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:06,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:06,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 294 [2023-11-19 07:43:06,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:08,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][122], [107#L794true, 192#true, Black: 260#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 194#(= ~__unbuffered_p3_EAX~0 0), Black: 259#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), 152#L827true, Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 264#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), 90#P0EXITtrue, Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 232#true, P2Thread1of1ForFork3InUse, Black: 224#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 162#true, Black: 221#(and (= ~y$w_buff0_used~0 0) (= ~y~0 1)), 41#P1EXITtrue, 269#true, 5#L851-3true, 255#true, Black: 235#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 176#true, Black: 234#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 246#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:08,236 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-19 07:43:08,236 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:43:08,237 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:43:08,237 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:43:08,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L855-->L862: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd0~0_90 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_86 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_165 256) 0)))) (let ((.cse4 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_147 256) 0)) .cse2)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_166 256) 0))))) (and (= v_~y~0_89 (ite .cse0 v_~y$w_buff0~0_87 (ite .cse1 v_~y$w_buff1~0_72 v_~y~0_90))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) .cse2) (and (not (= (mod v_~y$r_buff0_thd0~0_85 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_90) v_~y$r_buff1_thd0~0_89) (= v_~y$r_buff0_thd0~0_85 (ite .cse4 0 v_~y$r_buff0_thd0~0_86)) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17| 0)) (= (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_147) v_~y$w_buff1_used~0_146) (= v_~y$w_buff0_used~0_165 (ite .cse0 0 v_~y$w_buff0_used~0_166))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_166, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_87, ~y~0=v_~y~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_90, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_147, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_87, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|, ~y~0=v_~y~0_89, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][65], [107#L794true, 192#true, Black: 260#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 259#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 194#(= ~__unbuffered_p3_EAX~0 0), Black: 264#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), 90#P0EXITtrue, Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 126#L820true, 92#L862true, P3Thread1of1ForFork1InUse, 232#true, P2Thread1of1ForFork3InUse, Black: 224#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 162#true, Black: 221#(and (= ~y$w_buff0_used~0 0) (= ~y~0 1)), 41#P1EXITtrue, 269#true, 255#true, Black: 235#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 176#true, Black: 234#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 246#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:08,532 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:43:08,532 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:08,532 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:08,532 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:08,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][122], [18#L855true, 107#L794true, 192#true, Black: 260#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 259#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 194#(= ~__unbuffered_p3_EAX~0 0), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 152#L827true, Black: 264#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), 90#P0EXITtrue, Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 232#true, P2Thread1of1ForFork3InUse, Black: 224#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 162#true, Black: 221#(and (= ~y$w_buff0_used~0 0) (= ~y~0 1)), 41#P1EXITtrue, 269#true, 255#true, Black: 235#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 176#true, Black: 234#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 246#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:08,533 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:43:08,533 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:08,533 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:08,533 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:09,303 INFO L124 PetriNetUnfolderBase]: 11199/15968 cut-off events. [2023-11-19 07:43:09,303 INFO L125 PetriNetUnfolderBase]: For 120212/120811 co-relation queries the response was YES. [2023-11-19 07:43:09,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88949 conditions, 15968 events. 11199/15968 cut-off events. For 120212/120811 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 89307 event pairs, 1788 based on Foata normal form. 603/16217 useless extension candidates. Maximal degree in co-relation 88924. Up to 11256 conditions per place. [2023-11-19 07:43:09,495 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 110 selfloop transitions, 30 changer transitions 28/181 dead transitions. [2023-11-19 07:43:09,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 181 transitions, 2295 flow [2023-11-19 07:43:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:43:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:43:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 984 transitions. [2023-11-19 07:43:09,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478134110787172 [2023-11-19 07:43:09,501 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 984 transitions. [2023-11-19 07:43:09,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 984 transitions. [2023-11-19 07:43:09,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:09,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 984 transitions. [2023-11-19 07:43:09,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.57142857142858) internal successors, (984), 7 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:09,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:09,514 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:09,514 INFO L175 Difference]: Start difference. First operand has 76 places, 108 transitions, 1281 flow. Second operand 7 states and 984 transitions. [2023-11-19 07:43:09,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 181 transitions, 2295 flow [2023-11-19 07:43:09,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 181 transitions, 2264 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-19 07:43:09,754 INFO L231 Difference]: Finished difference. Result has 81 places, 116 transitions, 1457 flow [2023-11-19 07:43:09,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1457, PETRI_PLACES=81, PETRI_TRANSITIONS=116} [2023-11-19 07:43:09,755 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2023-11-19 07:43:09,755 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 116 transitions, 1457 flow [2023-11-19 07:43:09,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:09,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:09,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:09,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:43:09,757 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:43:09,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1265345767, now seen corresponding path program 2 times [2023-11-19 07:43:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:09,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574008643] [2023-11-19 07:43:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:09,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:10,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:10,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574008643] [2023-11-19 07:43:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574008643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:10,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:10,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:43:10,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626081451] [2023-11-19 07:43:10,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:10,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:43:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:43:10,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:43:10,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 294 [2023-11-19 07:43:10,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 116 transitions, 1457 flow. Second operand has 7 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:10,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:10,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 294 [2023-11-19 07:43:10,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:43:12,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][117], [107#L794true, 192#true, Black: 259#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 194#(= ~__unbuffered_p3_EAX~0 0), 152#L827true, Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 264#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), 90#P0EXITtrue, Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, Black: 281#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P1Thread1of1ForFork0InUse, Black: 277#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 275#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), P3Thread1of1ForFork1InUse, Black: 279#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 232#true, 287#true, P2Thread1of1ForFork3InUse, Black: 224#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 162#true, Black: 221#(and (= ~y$w_buff0_used~0 0) (= ~y~0 1)), 41#P1EXITtrue, 269#true, 5#L851-3true, Black: 235#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 176#true, Black: 234#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 246#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:12,675 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-19 07:43:12,676 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:43:12,676 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:43:12,676 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:43:12,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L820-->L827: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_93)) (= v_~y$w_buff0_used~0_97 (ite .cse2 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26)) (= v_~y~0_51 (ite .cse2 v_~y$w_buff0~0_37 (ite .cse1 v_~y$w_buff1~0_34 v_~y~0_52)))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][117], [18#L855true, 107#L794true, 192#true, Black: 194#(= ~__unbuffered_p3_EAX~0 0), Black: 259#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 152#L827true, Black: 264#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), 90#P0EXITtrue, Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, Black: 281#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P1Thread1of1ForFork0InUse, Black: 277#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 275#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), P3Thread1of1ForFork1InUse, Black: 279#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 232#true, 287#true, P2Thread1of1ForFork3InUse, Black: 224#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 162#true, Black: 221#(and (= ~y$w_buff0_used~0 0) (= ~y~0 1)), 41#P1EXITtrue, 269#true, Black: 235#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 234#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 176#true, Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 246#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:12,937 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:43:12,937 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:12,937 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:12,938 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:12,938 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L855-->L862: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd0~0_90 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_86 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_165 256) 0)))) (let ((.cse4 (and .cse5 .cse3)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_147 256) 0)) .cse2)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_166 256) 0))))) (and (= v_~y~0_89 (ite .cse0 v_~y$w_buff0~0_87 (ite .cse1 v_~y$w_buff1~0_72 v_~y~0_90))) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) .cse2) (and (not (= (mod v_~y$r_buff0_thd0~0_85 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_90) v_~y$r_buff1_thd0~0_89) (= v_~y$r_buff0_thd0~0_85 (ite .cse4 0 v_~y$r_buff0_thd0~0_86)) (not (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17| 0)) (= (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_147) v_~y$w_buff1_used~0_146) (= v_~y$w_buff0_used~0_165 (ite .cse0 0 v_~y$w_buff0_used~0_166))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_166, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_87, ~y~0=v_~y~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_90, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_147, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_17|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_87, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_28|, ~y~0=v_~y~0_89, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][65], [107#L794true, 192#true, Black: 259#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0)), Black: 194#(= ~__unbuffered_p3_EAX~0 0), Black: 264#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 195#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 174#(and (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|)) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t807~0#1.base|)) (not (= |ULTIMATE.start_main_~#t807~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t807~0#1.base| 0) |ULTIMATE.start_main_~#t806~0#1.base| 0) |ULTIMATE.start_main_~#t805~0#1.base| 0) |ULTIMATE.start_main_~#t808~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t808~0#1.base| |ULTIMATE.start_main_~#t806~0#1.base|)) (not (= |ULTIMATE.start_main_~#t806~0#1.base| |ULTIMATE.start_main_~#t805~0#1.base|))), 90#P0EXITtrue, Black: 210#(= ~x~0 0), Black: 213#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P0Thread1of1ForFork2InUse, Black: 281#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P1Thread1of1ForFork0InUse, Black: 277#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 1)), Black: 275#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 126#L820true, Black: 279#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), P3Thread1of1ForFork1InUse, 92#L862true, 232#true, 287#true, P2Thread1of1ForFork3InUse, Black: 224#(and (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 162#true, Black: 221#(and (= ~y$w_buff0_used~0 0) (= ~y~0 1)), 41#P1EXITtrue, 269#true, Black: 235#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 182#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 179#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 234#(and (= ~y$w_buff0_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 180#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 176#true, Black: 184#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 246#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$w_buff0_used~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0))]) [2023-11-19 07:43:12,939 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:43:12,939 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:12,939 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:12,939 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:43:13,552 INFO L124 PetriNetUnfolderBase]: 11133/15886 cut-off events. [2023-11-19 07:43:13,552 INFO L125 PetriNetUnfolderBase]: For 143828/144761 co-relation queries the response was YES. [2023-11-19 07:43:13,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91747 conditions, 15886 events. 11133/15886 cut-off events. For 143828/144761 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 88829 event pairs, 1778 based on Foata normal form. 651/16226 useless extension candidates. Maximal degree in co-relation 91719. Up to 11248 conditions per place. [2023-11-19 07:43:13,736 INFO L140 encePairwiseOnDemand]: 288/294 looper letters, 109 selfloop transitions, 32 changer transitions 28/182 dead transitions. [2023-11-19 07:43:13,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 182 transitions, 2433 flow [2023-11-19 07:43:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:43:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:43:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 984 transitions. [2023-11-19 07:43:13,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478134110787172 [2023-11-19 07:43:13,741 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 984 transitions. [2023-11-19 07:43:13,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 984 transitions. [2023-11-19 07:43:13,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:43:13,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 984 transitions. [2023-11-19 07:43:13,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.57142857142858) internal successors, (984), 7 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:13,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:13,752 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:13,753 INFO L175 Difference]: Start difference. First operand has 81 places, 116 transitions, 1457 flow. Second operand 7 states and 984 transitions. [2023-11-19 07:43:13,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 182 transitions, 2433 flow [2023-11-19 07:43:14,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 182 transitions, 2337 flow, removed 20 selfloop flow, removed 6 redundant places. [2023-11-19 07:43:14,084 INFO L231 Difference]: Finished difference. Result has 82 places, 121 transitions, 1566 flow [2023-11-19 07:43:14,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1566, PETRI_PLACES=82, PETRI_TRANSITIONS=121} [2023-11-19 07:43:14,085 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2023-11-19 07:43:14,086 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 121 transitions, 1566 flow [2023-11-19 07:43:14,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:14,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:43:14,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:43:14,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:43:14,087 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:43:14,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:43:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1475806268, now seen corresponding path program 1 times [2023-11-19 07:43:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:43:14,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773667999] [2023-11-19 07:43:14,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:43:14,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:43:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:43:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:43:15,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:43:15,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773667999] [2023-11-19 07:43:15,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773667999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:43:15,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:43:15,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:43:15,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118257399] [2023-11-19 07:43:15,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:43:15,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:43:15,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:43:15,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:43:15,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:43:15,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 294 [2023-11-19 07:43:15,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 121 transitions, 1566 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:43:15,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:43:15,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 294 [2023-11-19 07:43:15,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand