./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix007.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix007.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:09:55,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:09:56,021 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:09:56,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:09:56,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:09:56,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:09:56,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:09:56,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:09:56,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:09:56,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:09:56,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:09:56,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:09:56,067 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:09:56,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:09:56,069 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:09:56,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:09:56,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:09:56,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:09:56,075 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:09:56,076 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:09:56,081 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:09:56,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:09:56,083 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:09:56,083 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:09:56,083 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:09:56,084 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:09:56,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:09:56,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:09:56,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:09:56,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:09:56,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:09:56,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:09:56,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:09:56,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:09:56,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:09:56,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:09:56,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:09:56,101 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:09:56,102 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_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f [2023-11-06 22:09:56,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:09:56,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:09:56,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:09:56,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:09:56,408 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:09:56,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix007.opt.i [2023-11-06 22:09:59,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:09:59,955 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:09:59,956 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/sv-benchmarks/c/pthread-wmm/mix007.opt.i [2023-11-06 22:09:59,979 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/data/05ada7266/ad216d76eb6d418a8f101abb7e36d0ca/FLAG6425696cf [2023-11-06 22:09:59,994 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/data/05ada7266/ad216d76eb6d418a8f101abb7e36d0ca [2023-11-06 22:09:59,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:09:59,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:10:00,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:00,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:10:00,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:10:00,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:09:59" (1/1) ... [2023-11-06 22:10:00,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ac55b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00, skipping insertion in model container [2023-11-06 22:10:00,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:09:59" (1/1) ... [2023-11-06 22:10:00,087 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:10:00,555 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:00,578 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:10:00,711 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:00,770 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:10:00,770 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:10:00,778 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:10:00,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00 WrapperNode [2023-11-06 22:10:00,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:00,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:00,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:10:00,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:10:00,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (1/1) ... [2023-11-06 22:10:00,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (1/1) ... [2023-11-06 22:10:00,893 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2023-11-06 22:10:00,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:00,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:10:00,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:10:00,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:10:00,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (1/1) ... [2023-11-06 22:10:00,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (1/1) ... [2023-11-06 22:10:00,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (1/1) ... [2023-11-06 22:10:00,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (1/1) ... [2023-11-06 22:10:00,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (1/1) ... [2023-11-06 22:10:00,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (1/1) ... [2023-11-06 22:10:00,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (1/1) ... [2023-11-06 22:10:00,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (1/1) ... [2023-11-06 22:10:00,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:10:00,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:10:00,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:10:00,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:10:00,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (1/1) ... [2023-11-06 22:10:00,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:00,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:01,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:10:01,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:10:01,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:10:01,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:10:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:10:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:10:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:10:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:10:01,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:10:01,065 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:10:01,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:10:01,066 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:10:01,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:10:01,066 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:10:01,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:10:01,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:10:01,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:10:01,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:10:01,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:10:01,070 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:10:01,269 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:10:01,272 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:10:01,712 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:10:01,937 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:10:01,937 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:10:01,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:01 BoogieIcfgContainer [2023-11-06 22:10:01,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:10:01,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:10:01,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:10:01,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:10:01,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:09:59" (1/3) ... [2023-11-06 22:10:01,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7fbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:01, skipping insertion in model container [2023-11-06 22:10:01,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:00" (2/3) ... [2023-11-06 22:10:01,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7fbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:01, skipping insertion in model container [2023-11-06 22:10:01,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:01" (3/3) ... [2023-11-06 22:10:01,962 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.opt.i [2023-11-06 22:10:01,990 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:10:01,991 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:10:01,991 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:10:02,117 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:10:02,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:10:02,262 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:10:02,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:10:02,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:10:02,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:10:02,278 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 146 transitions, 304 flow [2023-11-06 22:10:02,282 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:10:02,301 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:10:02,306 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:10:02,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 304 flow [2023-11-06 22:10:02,368 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:10:02,368 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:10:02,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:10:02,374 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-11-06 22:10:08,878 INFO L134 LiptonReduction]: Checked pairs total: 9206 [2023-11-06 22:10:08,879 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-11-06 22:10:08,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:10:08,903 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;@6c6233d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:10:08,904 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:10:08,905 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:10:08,906 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:10:08,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:10:08,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:08,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:10:08,907 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:08,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash 663, now seen corresponding path program 1 times [2023-11-06 22:10:08,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:08,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101982253] [2023-11-06 22:10:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:09,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101982253] [2023-11-06 22:10:09,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101982253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:09,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:09,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:10:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052208389] [2023-11-06 22:10:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:09,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:10:09,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:09,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:10:09,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:10:09,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 298 [2023-11-06 22:10:09,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:09,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:09,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 298 [2023-11-06 22:10:09,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:10,098 INFO L124 PetriNetUnfolderBase]: 3743/5242 cut-off events. [2023-11-06 22:10:10,099 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-06 22:10:10,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10482 conditions, 5242 events. 3743/5242 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 26864 event pairs, 3743 based on Foata normal form. 0/4473 useless extension candidates. Maximal degree in co-relation 10470. Up to 5137 conditions per place. [2023-11-06 22:10:10,152 INFO L140 encePairwiseOnDemand]: 289/298 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-11-06 22:10:10,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-11-06 22:10:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:10:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:10:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2023-11-06 22:10:10,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5134228187919463 [2023-11-06 22:10:10,177 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2023-11-06 22:10:10,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2023-11-06 22:10:10,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:10,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2023-11-06 22:10:10,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:10,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:10,201 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:10,208 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 306 transitions. [2023-11-06 22:10:10,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-11-06 22:10:10,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:10:10,214 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-11-06 22:10:10,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-06 22:10:10,220 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-11-06 22:10:10,221 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-11-06 22:10:10,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:10,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:10,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:10,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:10:10,222 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:10,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:10,223 INFO L85 PathProgramCache]: Analyzing trace with hash 699035326, now seen corresponding path program 1 times [2023-11-06 22:10:10,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:10,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212399941] [2023-11-06 22:10:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:10,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:10,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:10,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212399941] [2023-11-06 22:10:10,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212399941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:10,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:10,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:10:10,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601797435] [2023-11-06 22:10:10,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:10,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:10,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:10,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:10,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 298 [2023-11-06 22:10:10,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:10,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:10,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 298 [2023-11-06 22:10:10,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:11,535 INFO L124 PetriNetUnfolderBase]: 3113/4531 cut-off events. [2023-11-06 22:10:11,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:10:11,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8922 conditions, 4531 events. 3113/4531 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 24581 event pairs, 593 based on Foata normal form. 0/4158 useless extension candidates. Maximal degree in co-relation 8919. Up to 3385 conditions per place. [2023-11-06 22:10:11,574 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-11-06 22:10:11,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 160 flow [2023-11-06 22:10:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:10:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-11-06 22:10:11,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49440715883668906 [2023-11-06 22:10:11,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-11-06 22:10:11,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-11-06 22:10:11,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:11,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-11-06 22:10:11,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:11,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:11,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:11,594 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 442 transitions. [2023-11-06 22:10:11,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 160 flow [2023-11-06 22:10:11,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:10:11,596 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-11-06 22:10:11,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-06 22:10:11,598 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-11-06 22:10:11,598 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-11-06 22:10:11,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:11,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:11,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:11,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:10:11,606 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:11,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1758092068, now seen corresponding path program 1 times [2023-11-06 22:10:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:11,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130077704] [2023-11-06 22:10:11,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:11,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:12,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:12,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130077704] [2023-11-06 22:10:12,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130077704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:12,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:12,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476614811] [2023-11-06 22:10:12,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:12,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:12,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:12,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:12,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:10:13,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 298 [2023-11-06 22:10:13,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:13,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:13,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 298 [2023-11-06 22:10:13,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:13,684 INFO L124 PetriNetUnfolderBase]: 2150/3124 cut-off events. [2023-11-06 22:10:13,684 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-06 22:10:13,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6338 conditions, 3124 events. 2150/3124 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 15517 event pairs, 324 based on Foata normal form. 72/3088 useless extension candidates. Maximal degree in co-relation 6334. Up to 2026 conditions per place. [2023-11-06 22:10:13,715 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 40 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-11-06 22:10:13,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 200 flow [2023-11-06 22:10:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:10:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:10:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 761 transitions. [2023-11-06 22:10:13,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4256152125279642 [2023-11-06 22:10:13,719 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 761 transitions. [2023-11-06 22:10:13,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 761 transitions. [2023-11-06 22:10:13,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:13,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 761 transitions. [2023-11-06 22:10:13,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:13,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:13,729 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:13,729 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 6 states and 761 transitions. [2023-11-06 22:10:13,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 200 flow [2023-11-06 22:10:13,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:10:13,733 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 78 flow [2023-11-06 22:10:13,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-11-06 22:10:13,735 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2023-11-06 22:10:13,735 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 78 flow [2023-11-06 22:10:13,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:13,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:13,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:13,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:10:13,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:13,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1582523922, now seen corresponding path program 1 times [2023-11-06 22:10:13,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:13,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750078924] [2023-11-06 22:10:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:13,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:14,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:14,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750078924] [2023-11-06 22:10:14,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750078924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:14,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:14,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:14,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603122458] [2023-11-06 22:10:14,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:14,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:14,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:14,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:14,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:10:14,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 298 [2023-11-06 22:10:14,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:14,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:14,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 298 [2023-11-06 22:10:14,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:15,207 INFO L124 PetriNetUnfolderBase]: 1853/2716 cut-off events. [2023-11-06 22:10:15,207 INFO L125 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2023-11-06 22:10:15,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5790 conditions, 2716 events. 1853/2716 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13523 event pairs, 375 based on Foata normal form. 0/2716 useless extension candidates. Maximal degree in co-relation 5785. Up to 2469 conditions per place. [2023-11-06 22:10:15,230 INFO L140 encePairwiseOnDemand]: 293/298 looper letters, 31 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-11-06 22:10:15,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 170 flow [2023-11-06 22:10:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:10:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:10:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2023-11-06 22:10:15,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40939597315436244 [2023-11-06 22:10:15,234 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 732 transitions. [2023-11-06 22:10:15,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 732 transitions. [2023-11-06 22:10:15,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:15,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 732 transitions. [2023-11-06 22:10:15,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:15,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:15,243 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 298.0) internal successors, (2086), 7 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:15,243 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 78 flow. Second operand 6 states and 732 transitions. [2023-11-06 22:10:15,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 170 flow [2023-11-06 22:10:15,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-06 22:10:15,247 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 72 flow [2023-11-06 22:10:15,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-11-06 22:10:15,249 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -8 predicate places. [2023-11-06 22:10:15,249 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 72 flow [2023-11-06 22:10:15,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:15,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:15,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:15,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:10:15,251 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:15,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:15,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1603079685, now seen corresponding path program 1 times [2023-11-06 22:10:15,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:15,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835694452] [2023-11-06 22:10:15,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:15,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:15,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:15,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835694452] [2023-11-06 22:10:15,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835694452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:15,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:15,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:10:15,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703838433] [2023-11-06 22:10:15,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:15,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:15,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:15,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:15,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:15,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 298 [2023-11-06 22:10:15,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:15,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:15,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 298 [2023-11-06 22:10:15,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:16,718 INFO L124 PetriNetUnfolderBase]: 6311/8720 cut-off events. [2023-11-06 22:10:16,718 INFO L125 PetriNetUnfolderBase]: For 689/689 co-relation queries the response was YES. [2023-11-06 22:10:16,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18324 conditions, 8720 events. 6311/8720 cut-off events. For 689/689 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 41476 event pairs, 1751 based on Foata normal form. 224/8944 useless extension candidates. Maximal degree in co-relation 18319. Up to 4761 conditions per place. [2023-11-06 22:10:16,783 INFO L140 encePairwiseOnDemand]: 290/298 looper letters, 49 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-11-06 22:10:16,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 256 flow [2023-11-06 22:10:16,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:10:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2023-11-06 22:10:16,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46812080536912754 [2023-11-06 22:10:16,786 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2023-11-06 22:10:16,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2023-11-06 22:10:16,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:16,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2023-11-06 22:10:16,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:16,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:16,793 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:16,794 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 72 flow. Second operand 4 states and 558 transitions. [2023-11-06 22:10:16,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 256 flow [2023-11-06 22:10:16,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 247 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:10:16,797 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 118 flow [2023-11-06 22:10:16,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-06 22:10:16,798 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-11-06 22:10:16,798 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 118 flow [2023-11-06 22:10:16,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:16,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:16,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:16,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:10:16,799 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:16,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1299464831, now seen corresponding path program 1 times [2023-11-06 22:10:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:16,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913412193] [2023-11-06 22:10:16,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:16,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:17,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:17,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913412193] [2023-11-06 22:10:17,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913412193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:17,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:17,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:17,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910373323] [2023-11-06 22:10:17,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:17,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:17,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:17,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:17,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2023-11-06 22:10:17,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 118 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-06 22:10:17,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:17,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2023-11-06 22:10:17,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:17,494 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][37], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 193#true, 63#L758true, 100#P1EXITtrue, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, 185#true, 31#L876-3true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:17,494 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 22:10:17,494 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:17,494 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:17,495 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:17,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][41], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 33#L880true, 63#L758true, 56#L773true, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, 185#true, 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:17,501 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 22:10:17,502 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:17,502 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:17,502 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:17,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][37], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 193#true, 63#L758true, 100#P1EXITtrue, 152#L845true, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 185#true, 31#L876-3true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 121#L804true, 163#true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:17,610 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,610 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,610 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,610 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][37], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 33#L880true, 193#true, 63#L758true, 100#P1EXITtrue, Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 185#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:17,613 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,613 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,613 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,614 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][63], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 33#L880true, 63#L758true, 100#P1EXITtrue, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, 185#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:17,620 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,621 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,621 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,621 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][41], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 33#L880true, 63#L758true, 56#L773true, 152#L845true, Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 185#true, 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:17,622 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,623 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,623 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,623 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:17,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][37], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 33#L880true, 193#true, 63#L758true, 100#P1EXITtrue, 152#L845true, Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 185#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:17,746 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,746 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,746 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,746 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][37], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 193#true, 63#L758true, 100#P1EXITtrue, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, 185#true, 138#L887true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:17,747 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,747 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,747 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,747 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L887-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_28|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_14) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~y~0_16 2) (= v_~__unbuffered_p0_EAX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p3_EAX~0_24 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_28| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~y~0=v_~y~0_16} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_30|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_28|, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_30|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][75], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 72#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, P3Thread1of1ForFork3InUse, 193#true, 63#L758true, 100#P1EXITtrue, 40#L842true, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 185#true, 19#L788true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, P1Thread1of1ForFork2InUse, Black: 187#(= ~__unbuffered_p2_EAX~0 0)]) [2023-11-06 22:10:17,759 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,759 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,759 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,760 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:17,826 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L887-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_28|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_14) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~y~0_16 2) (= v_~__unbuffered_p0_EAX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p3_EAX~0_24 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_28| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~y~0=v_~y~0_16} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_30|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_28|, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_30|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][75], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 72#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, P3Thread1of1ForFork3InUse, 193#true, 63#L758true, 100#P1EXITtrue, 152#L845true, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 185#true, 19#L788true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, P1Thread1of1ForFork2InUse, Black: 187#(= ~__unbuffered_p2_EAX~0 0)]) [2023-11-06 22:10:17,826 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:10:17,826 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:10:17,826 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:10:17,826 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:10:17,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][37], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 193#true, 63#L758true, 100#P1EXITtrue, 152#L845true, Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 185#true, 138#L887true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:17,883 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-11-06 22:10:17,884 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-06 22:10:17,884 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-06 22:10:17,884 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-06 22:10:17,971 INFO L124 PetriNetUnfolderBase]: 3884/5705 cut-off events. [2023-11-06 22:10:17,972 INFO L125 PetriNetUnfolderBase]: For 2267/2430 co-relation queries the response was YES. [2023-11-06 22:10:17,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13931 conditions, 5705 events. 3884/5705 cut-off events. For 2267/2430 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 32571 event pairs, 780 based on Foata normal form. 402/5727 useless extension candidates. Maximal degree in co-relation 13924. Up to 3831 conditions per place. [2023-11-06 22:10:18,014 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 60 selfloop transitions, 10 changer transitions 0/77 dead transitions. [2023-11-06 22:10:18,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 400 flow [2023-11-06 22:10:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:10:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 709 transitions. [2023-11-06 22:10:18,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47583892617449663 [2023-11-06 22:10:18,018 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 709 transitions. [2023-11-06 22:10:18,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 709 transitions. [2023-11-06 22:10:18,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:18,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 709 transitions. [2023-11-06 22:10:18,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:18,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:18,025 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 298.0) internal successors, (1788), 6 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:18,025 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 118 flow. Second operand 5 states and 709 transitions. [2023-11-06 22:10:18,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 400 flow [2023-11-06 22:10:18,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:10:18,030 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 191 flow [2023-11-06 22:10:18,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-11-06 22:10:18,031 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2023-11-06 22:10:18,031 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 191 flow [2023-11-06 22:10:18,032 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-06 22:10:18,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:18,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:18,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:10:18,032 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:18,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1160166301, now seen corresponding path program 1 times [2023-11-06 22:10:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300015299] [2023-11-06 22:10:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:18,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:18,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300015299] [2023-11-06 22:10:18,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300015299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:18,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:18,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:18,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051376808] [2023-11-06 22:10:18,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:18,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:18,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:18,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 298 [2023-11-06 22:10:18,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:18,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:18,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 298 [2023-11-06 22:10:18,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:18,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][29], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 205#(= ~a~0 1), 193#true, 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 100#P1EXITtrue, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, 185#true, 31#L876-3true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:18,782 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 22:10:18,782 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:18,782 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:18,782 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:18,905 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][29], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 205#(= ~a~0 1), 33#L880true, 193#true, 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 100#P1EXITtrue, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, 185#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:18,905 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:18,905 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:18,905 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:18,905 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:19,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][29], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 205#(= ~a~0 1), 193#true, 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 100#P1EXITtrue, Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 185#true, 138#L887true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:19,007 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 22:10:19,007 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:19,007 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:19,007 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:19,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L887-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_28|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_14) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~y~0_16 2) (= v_~__unbuffered_p0_EAX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p3_EAX~0_24 1))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_28| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_36| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~y~0=v_~y~0_16} OutVars{ULTIMATE.start_reach_error_#t~nondet0#1.offset=|v_ULTIMATE.start_reach_error_#t~nondet0#1.offset_30|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_28|, ULTIMATE.start_reach_error_#t~nondet0#1.base=|v_ULTIMATE.start_reach_error_#t~nondet0#1.base_30|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[ULTIMATE.start_reach_error_#t~nondet0#1.offset, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_reach_error_#t~nondet0#1.base, ~main$tmp_guard1~0][84], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 72#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 205#(= ~a~0 1), 193#true, 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 100#P1EXITtrue, 40#L842true, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 185#true, 19#L788true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, P1Thread1of1ForFork2InUse, Black: 187#(= ~__unbuffered_p2_EAX~0 0)]) [2023-11-06 22:10:19,029 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 22:10:19,029 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:19,029 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:19,029 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 22:10:19,355 INFO L124 PetriNetUnfolderBase]: 5343/8025 cut-off events. [2023-11-06 22:10:19,355 INFO L125 PetriNetUnfolderBase]: For 8139/8369 co-relation queries the response was YES. [2023-11-06 22:10:19,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26417 conditions, 8025 events. 5343/8025 cut-off events. For 8139/8369 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 48979 event pairs, 1306 based on Foata normal form. 97/7830 useless extension candidates. Maximal degree in co-relation 26406. Up to 4279 conditions per place. [2023-11-06 22:10:19,414 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 62 selfloop transitions, 3 changer transitions 19/89 dead transitions. [2023-11-06 22:10:19,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 89 transitions, 594 flow [2023-11-06 22:10:19,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:10:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2023-11-06 22:10:19,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4874161073825503 [2023-11-06 22:10:19,418 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 581 transitions. [2023-11-06 22:10:19,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 581 transitions. [2023-11-06 22:10:19,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:19,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 581 transitions. [2023-11-06 22:10:19,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:19,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:19,424 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:19,424 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 191 flow. Second operand 4 states and 581 transitions. [2023-11-06 22:10:19,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 89 transitions, 594 flow [2023-11-06 22:10:19,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 89 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:10:19,454 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 189 flow [2023-11-06 22:10:19,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-11-06 22:10:19,455 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-11-06 22:10:19,456 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 189 flow [2023-11-06 22:10:19,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:19,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:19,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:19,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:10:19,457 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:19,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:19,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1040684523, now seen corresponding path program 1 times [2023-11-06 22:10:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:19,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194404448] [2023-11-06 22:10:19,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:19,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:19,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:19,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194404448] [2023-11-06 22:10:19,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194404448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:19,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:19,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:10:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349270642] [2023-11-06 22:10:19,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:19,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:19,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:19,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:19,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 298 [2023-11-06 22:10:19,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:19,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:19,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 298 [2023-11-06 22:10:19,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:20,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][34], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, Black: 195#(= ~__unbuffered_cnt~0 0), 63#L758true, Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 100#P1EXITtrue, 152#L845true, 214#(= ~y~0 1), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 205#(= ~a~0 1), 185#true, 31#L876-3true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 121#L804true, 163#true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:20,362 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:20,362 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:20,362 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:20,362 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:20,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][34], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 33#L880true, 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 100#P1EXITtrue, 152#L845true, 214#(= ~y~0 1), 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 205#(= ~a~0 1), 185#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, P1Thread1of1ForFork2InUse, Black: 187#(= ~__unbuffered_p2_EAX~0 0)]) [2023-11-06 22:10:20,572 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-06 22:10:20,572 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-06 22:10:20,572 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-06 22:10:20,572 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-06 22:10:20,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][34], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 196#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 100#P1EXITtrue, 152#L845true, 214#(= ~y~0 1), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 205#(= ~a~0 1), 185#true, 138#L887true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:20,590 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 22:10:20,591 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:10:20,591 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:10:20,591 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 22:10:20,923 INFO L124 PetriNetUnfolderBase]: 6109/9206 cut-off events. [2023-11-06 22:10:20,923 INFO L125 PetriNetUnfolderBase]: For 11300/11388 co-relation queries the response was YES. [2023-11-06 22:10:20,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30975 conditions, 9206 events. 6109/9206 cut-off events. For 11300/11388 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 57759 event pairs, 2607 based on Foata normal form. 105/8870 useless extension candidates. Maximal degree in co-relation 30962. Up to 4659 conditions per place. [2023-11-06 22:10:20,988 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 48 selfloop transitions, 3 changer transitions 1/59 dead transitions. [2023-11-06 22:10:20,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 383 flow [2023-11-06 22:10:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:10:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-11-06 22:10:20,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49105145413870244 [2023-11-06 22:10:20,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-11-06 22:10:20,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-11-06 22:10:20,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:20,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-11-06 22:10:20,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:20,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:20,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:20,996 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 189 flow. Second operand 3 states and 439 transitions. [2023-11-06 22:10:20,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 383 flow [2023-11-06 22:10:21,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 377 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-06 22:10:21,051 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 201 flow [2023-11-06 22:10:21,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-11-06 22:10:21,052 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-11-06 22:10:21,052 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 201 flow [2023-11-06 22:10:21,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:21,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:21,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:21,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:10:21,053 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:21,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:21,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2085722323, now seen corresponding path program 1 times [2023-11-06 22:10:21,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:21,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791049397] [2023-11-06 22:10:21,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:21,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791049397] [2023-11-06 22:10:21,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791049397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:21,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:21,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543684201] [2023-11-06 22:10:21,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:21,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:10:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:21,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:10:21,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:21,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2023-11-06 22:10:21,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:21,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:21,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2023-11-06 22:10:21,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:21,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][38], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 220#(<= ~__unbuffered_cnt~0 1), 205#(= ~a~0 1), Black: 195#(= ~__unbuffered_cnt~0 0), 63#L758true, Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 100#P1EXITtrue, 214#(= ~y~0 1), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, Black: 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 185#true, 31#L876-3true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:21,777 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 22:10:21,777 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:21,778 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:21,778 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:21,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][43], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 205#(= ~a~0 1), 33#L880true, 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), 56#L773true, 214#(= ~y~0 1), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 185#true, 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork0InUse, 223#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork1InUse, 121#L804true, 163#true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:21,784 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 22:10:21,784 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:21,784 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:21,784 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:21,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][70], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 205#(= ~a~0 1), 33#L880true, 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 100#P1EXITtrue, 214#(= ~y~0 1), 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, Black: 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 185#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 121#L804true, 163#true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:21,890 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:21,890 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:21,890 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:21,890 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:21,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][38], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 220#(<= ~__unbuffered_cnt~0 1), Black: 195#(= ~__unbuffered_cnt~0 0), 63#L758true, Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 100#P1EXITtrue, 152#L845true, 214#(= ~y~0 1), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 205#(= ~a~0 1), 185#true, 31#L876-3true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:21,891 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:21,891 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:21,892 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:21,892 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:21,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][43], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 33#L880true, 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), 56#L773true, 152#L845true, 214#(= ~y~0 1), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 205#(= ~a~0 1), 185#true, 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork0InUse, 223#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork1InUse, 121#L804true, 163#true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:21,899 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:21,899 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:21,899 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:21,900 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:22,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][70], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 33#L880true, Black: 195#(= ~__unbuffered_cnt~0 0), 63#L758true, Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 100#P1EXITtrue, 152#L845true, 214#(= ~y~0 1), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 205#(= ~a~0 1), 185#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, P1Thread1of1ForFork2InUse, Black: 187#(= ~__unbuffered_p2_EAX~0 0)]) [2023-11-06 22:10:22,111 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-06 22:10:22,111 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-06 22:10:22,111 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-06 22:10:22,111 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-06 22:10:22,354 INFO L124 PetriNetUnfolderBase]: 4312/6680 cut-off events. [2023-11-06 22:10:22,354 INFO L125 PetriNetUnfolderBase]: For 5632/6024 co-relation queries the response was YES. [2023-11-06 22:10:22,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22190 conditions, 6680 events. 4312/6680 cut-off events. For 5632/6024 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 43126 event pairs, 505 based on Foata normal form. 639/6908 useless extension candidates. Maximal degree in co-relation 22177. Up to 3034 conditions per place. [2023-11-06 22:10:22,397 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 75 selfloop transitions, 14 changer transitions 15/112 dead transitions. [2023-11-06 22:10:22,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 112 transitions, 722 flow [2023-11-06 22:10:22,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:10:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:10:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 990 transitions. [2023-11-06 22:10:22,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47459252157238735 [2023-11-06 22:10:22,403 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 990 transitions. [2023-11-06 22:10:22,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 990 transitions. [2023-11-06 22:10:22,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:22,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 990 transitions. [2023-11-06 22:10:22,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.42857142857142) internal successors, (990), 7 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:22,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:22,415 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 298.0) internal successors, (2384), 8 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:22,415 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 201 flow. Second operand 7 states and 990 transitions. [2023-11-06 22:10:22,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 112 transitions, 722 flow [2023-11-06 22:10:22,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 112 transitions, 714 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:10:22,424 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 295 flow [2023-11-06 22:10:22,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=295, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-11-06 22:10:22,425 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-11-06 22:10:22,426 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 295 flow [2023-11-06 22:10:22,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:22,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:22,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:22,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:10:22,427 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:22,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:22,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1353027852, now seen corresponding path program 1 times [2023-11-06 22:10:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:22,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453580216] [2023-11-06 22:10:22,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:22,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453580216] [2023-11-06 22:10:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453580216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:22,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:22,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:10:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542052266] [2023-11-06 22:10:22,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:22,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:22,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:22,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:22,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:10:22,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2023-11-06 22:10:22,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:22,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:22,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2023-11-06 22:10:22,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:23,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][38], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 220#(<= ~__unbuffered_cnt~0 1), Black: 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 205#(= ~a~0 1), Black: 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 233#(<= ~__unbuffered_cnt~0 1), 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 100#P1EXITtrue, 214#(= ~y~0 1), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, Black: 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 185#true, 31#L876-3true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, P1Thread1of1ForFork2InUse, Black: 187#(= ~__unbuffered_p2_EAX~0 0)]) [2023-11-06 22:10:23,291 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 22:10:23,291 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:23,291 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:23,291 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:23,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][43], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 33#L880true, 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), 56#L773true, 237#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 214#(= ~y~0 1), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 185#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 223#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 121#L804true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, Black: 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 205#(= ~a~0 1), Black: 220#(<= ~__unbuffered_cnt~0 1), Black: 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 163#true, Black: 187#(= ~__unbuffered_p2_EAX~0 0)]) [2023-11-06 22:10:23,294 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 22:10:23,294 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:23,294 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:23,294 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 22:10:23,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][43], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 33#L880true, 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), 56#L773true, 152#L845true, 237#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 214#(= ~y~0 1), 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 205#(= ~a~0 1), 185#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 223#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 121#L804true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, Black: 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 220#(<= ~__unbuffered_cnt~0 1), Black: 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 163#true, Black: 187#(= ~__unbuffered_p2_EAX~0 0)]) [2023-11-06 22:10:23,355 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,355 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,355 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,355 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][68], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 205#(= ~a~0 1), Black: 220#(<= ~__unbuffered_cnt~0 1), 33#L880true, Black: 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 100#P1EXITtrue, 239#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 214#(= ~y~0 1), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 40#L842true, 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 185#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 163#true, 121#L804true, P1Thread1of1ForFork2InUse, Black: 187#(= ~__unbuffered_p2_EAX~0 0)]) [2023-11-06 22:10:23,375 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,375 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,375 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,375 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][38], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, 220#(<= ~__unbuffered_cnt~0 1), Black: 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 233#(<= ~__unbuffered_cnt~0 1), 63#L758true, Black: 195#(= ~__unbuffered_cnt~0 0), Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 100#P1EXITtrue, 152#L845true, 214#(= ~y~0 1), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 205#(= ~a~0 1), 185#true, 31#L876-3true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 121#L804true, 163#true, P1Thread1of1ForFork2InUse, Black: 187#(= ~__unbuffered_p2_EAX~0 0)]) [2023-11-06 22:10:23,376 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,376 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,376 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,376 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 22:10:23,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([467] L788-->L804: Formula: (let ((.cse5 (= (mod v_~z$r_buff1_thd3~0_44 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd3~0_44 256) 0))) (let ((.cse10 (not .cse9)) (.cse11 (= (mod v_~z$w_buff0_used~0_116 256) 0)) (.cse2 (and .cse5 .cse9)) (.cse3 (and .cse9 (= (mod v_~z$w_buff1_used~0_103 256) 0)))) (let ((.cse7 (or .cse11 .cse2 .cse3)) (.cse8 (and (not .cse11) .cse10)) (.cse0 (not (= (mod v_~weak$$choice2~0_62 256) 0))) (.cse6 (= (mod v_~z$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~z$w_buff0_used~0_115 256) 0))) (and (= v_~z$w_buff1_used~0_102 (ite .cse0 v_~z$w_buff1_used~0_103 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_103 0))) (= v_~z$r_buff1_thd3~0_43 (ite .cse0 v_~z$r_buff1_thd3~0_44 (ite (let ((.cse4 (= (mod v_~z$r_buff0_thd3~0_43 256) 0))) (or .cse1 (and .cse4 .cse5) (and .cse4 .cse6))) v_~z$r_buff1_thd3~0_44 0))) (= v_~z~0_110 (ite .cse0 v_~z$mem_tmp~0_46 v_~__unbuffered_p2_EBX~0_14)) (= v_~z$mem_tmp~0_46 v_~z~0_112) (= v_~__unbuffered_p2_EBX~0_14 (ite .cse7 v_~z~0_112 (ite .cse8 v_~z$w_buff0~0_47 v_~z$w_buff1~0_50))) (= v_~z$w_buff1~0_49 v_~z$w_buff1~0_50) (= v_~z$w_buff0_used~0_115 (ite .cse0 v_~z$w_buff0_used~0_116 (ite .cse7 v_~z$w_buff0_used~0_116 (ite .cse8 0 v_~z$w_buff0_used~0_116)))) (= v_~z$flush_delayed~0_66 0) (= v_~z$r_buff0_thd3~0_43 (ite .cse0 v_~z$r_buff0_thd3~0_44 (ite (or (and .cse6 .cse9) .cse1 .cse2) v_~z$r_buff0_thd3~0_44 (ite (and .cse10 (not .cse1)) 0 v_~z$r_buff0_thd3~0_44)))) (= v_~z$w_buff0~0_47 v_~z$w_buff0~0_46))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_103, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z$w_buff1~0=v_~z$w_buff1~0_50, ~z~0=v_~z~0_112} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_46, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_102, P2Thread1of1ForFork1_#t~nondet3=|v_P2Thread1of1ForFork1_#t~nondet3_1|, ~z$w_buff1~0=v_~z$w_buff1~0_49, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, P2Thread1of1ForFork1_#t~nondet4=|v_P2Thread1of1ForFork1_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_18, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_43, ~z~0=v_~z~0_110, ~weak$$choice2~0=v_~weak$$choice2~0_62} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, P2Thread1of1ForFork1_#t~nondet3, ~z$w_buff1~0, ~z$flush_delayed~0, P2Thread1of1ForFork1_#t~nondet4, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0][68], [Black: 188#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), P3Thread1of1ForFork3InUse, Black: 220#(<= ~__unbuffered_cnt~0 1), 33#L880true, Black: 221#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 195#(= ~__unbuffered_cnt~0 0), 63#L758true, Black: 198#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 100#P1EXITtrue, 239#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 152#L845true, 214#(= ~y~0 1), 225#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 208#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 183#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 175#(and (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t182~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t182~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t183~0#1.base| 0) |ULTIMATE.start_main_~#t184~0#1.base| 0) |ULTIMATE.start_main_~#t182~0#1.base| 0) |ULTIMATE.start_main_~#t181~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t183~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t181~0#1.base|)) (not (= |ULTIMATE.start_main_~#t184~0#1.base| |ULTIMATE.start_main_~#t183~0#1.base|))), Black: 205#(= ~a~0 1), 185#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 121#L804true, 163#true, Black: 187#(= ~__unbuffered_p2_EAX~0 0), P1Thread1of1ForFork2InUse]) [2023-11-06 22:10:23,514 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-06 22:10:23,514 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-06 22:10:23,514 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-06 22:10:23,514 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-06 22:10:23,670 INFO L124 PetriNetUnfolderBase]: 3529/5625 cut-off events. [2023-11-06 22:10:23,670 INFO L125 PetriNetUnfolderBase]: For 9362/10100 co-relation queries the response was YES. [2023-11-06 22:10:23,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22897 conditions, 5625 events. 3529/5625 cut-off events. For 9362/10100 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 37308 event pairs, 321 based on Foata normal form. 417/5673 useless extension candidates. Maximal degree in co-relation 22881. Up to 2637 conditions per place. [2023-11-06 22:10:23,696 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 79 selfloop transitions, 22 changer transitions 23/131 dead transitions. [2023-11-06 22:10:23,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 131 transitions, 932 flow [2023-11-06 22:10:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:10:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:10:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1272 transitions. [2023-11-06 22:10:23,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742729306487696 [2023-11-06 22:10:23,703 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1272 transitions. [2023-11-06 22:10:23,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1272 transitions. [2023-11-06 22:10:23,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:23,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1272 transitions. [2023-11-06 22:10:23,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 141.33333333333334) internal successors, (1272), 9 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:23,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 298.0) internal successors, (2980), 10 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:23,716 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 298.0) internal successors, (2980), 10 states have internal predecessors, (2980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:23,716 INFO L175 Difference]: Start difference. First operand has 62 places, 45 transitions, 295 flow. Second operand 9 states and 1272 transitions. [2023-11-06 22:10:23,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 131 transitions, 932 flow [2023-11-06 22:10:23,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 131 transitions, 891 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-11-06 22:10:23,954 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 393 flow [2023-11-06 22:10:23,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=393, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-11-06 22:10:23,955 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2023-11-06 22:10:23,955 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 393 flow [2023-11-06 22:10:23,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:23,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:23,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:23,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:10:23,957 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:23,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:23,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1761964562, now seen corresponding path program 1 times [2023-11-06 22:10:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:23,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939994734] [2023-11-06 22:10:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:23,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:24,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:24,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939994734] [2023-11-06 22:10:24,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939994734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:24,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:24,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649205086] [2023-11-06 22:10:24,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:24,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:24,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:24,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:24,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 298 [2023-11-06 22:10:24,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 393 flow. Second operand has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:24,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:24,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 298 [2023-11-06 22:10:24,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:25,337 INFO L124 PetriNetUnfolderBase]: 4941/8501 cut-off events. [2023-11-06 22:10:25,338 INFO L125 PetriNetUnfolderBase]: For 24230/24432 co-relation queries the response was YES. [2023-11-06 22:10:25,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35834 conditions, 8501 events. 4941/8501 cut-off events. For 24230/24432 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 65234 event pairs, 1119 based on Foata normal form. 9/8266 useless extension candidates. Maximal degree in co-relation 35815. Up to 4298 conditions per place. [2023-11-06 22:10:25,408 INFO L140 encePairwiseOnDemand]: 295/298 looper letters, 58 selfloop transitions, 2 changer transitions 53/118 dead transitions. [2023-11-06 22:10:25,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 118 transitions, 1160 flow [2023-11-06 22:10:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:10:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 584 transitions. [2023-11-06 22:10:25,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899328859060403 [2023-11-06 22:10:25,412 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 584 transitions. [2023-11-06 22:10:25,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 584 transitions. [2023-11-06 22:10:25,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:25,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 584 transitions. [2023-11-06 22:10:25,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:25,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:25,418 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 298.0) internal successors, (1490), 5 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:25,418 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 393 flow. Second operand 4 states and 584 transitions. [2023-11-06 22:10:25,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 118 transitions, 1160 flow [2023-11-06 22:10:26,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 118 transitions, 945 flow, removed 82 selfloop flow, removed 3 redundant places. [2023-11-06 22:10:26,087 INFO L231 Difference]: Finished difference. Result has 73 places, 42 transitions, 261 flow [2023-11-06 22:10:26,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=73, PETRI_TRANSITIONS=42} [2023-11-06 22:10:26,087 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-11-06 22:10:26,088 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 42 transitions, 261 flow [2023-11-06 22:10:26,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:26,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:26,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:26,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:10:26,088 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:26,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1024313472, now seen corresponding path program 2 times [2023-11-06 22:10:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:26,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182898064] [2023-11-06 22:10:26,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:26,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:26,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:10:26,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182898064] [2023-11-06 22:10:26,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182898064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:26,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:26,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:10:26,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816494477] [2023-11-06 22:10:26,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:26,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:10:26,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:10:26,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:10:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:10:26,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 298 [2023-11-06 22:10:26,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 42 transitions, 261 flow. Second operand has 7 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-06 22:10:26,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:26,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 298 [2023-11-06 22:10:26,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:26,950 INFO L124 PetriNetUnfolderBase]: 2264/3771 cut-off events. [2023-11-06 22:10:26,950 INFO L125 PetriNetUnfolderBase]: For 6429/6585 co-relation queries the response was YES. [2023-11-06 22:10:26,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13654 conditions, 3771 events. 2264/3771 cut-off events. For 6429/6585 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 24769 event pairs, 342 based on Foata normal form. 183/3701 useless extension candidates. Maximal degree in co-relation 13632. Up to 1245 conditions per place. [2023-11-06 22:10:26,966 INFO L140 encePairwiseOnDemand]: 291/298 looper letters, 29 selfloop transitions, 17 changer transitions 39/89 dead transitions. [2023-11-06 22:10:26,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 89 transitions, 637 flow [2023-11-06 22:10:26,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:10:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:10:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1113 transitions. [2023-11-06 22:10:26,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46686241610738255 [2023-11-06 22:10:26,971 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1113 transitions. [2023-11-06 22:10:26,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1113 transitions. [2023-11-06 22:10:26,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:26,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1113 transitions. [2023-11-06 22:10:26,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.125) internal successors, (1113), 8 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:26,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:26,982 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 298.0) internal successors, (2682), 9 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:26,983 INFO L175 Difference]: Start difference. First operand has 73 places, 42 transitions, 261 flow. Second operand 8 states and 1113 transitions. [2023-11-06 22:10:26,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 89 transitions, 637 flow [2023-11-06 22:10:27,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 573 flow, removed 24 selfloop flow, removed 7 redundant places. [2023-11-06 22:10:27,108 INFO L231 Difference]: Finished difference. Result has 69 places, 38 transitions, 246 flow [2023-11-06 22:10:27,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=298, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=246, PETRI_PLACES=69, PETRI_TRANSITIONS=38} [2023-11-06 22:10:27,109 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-11-06 22:10:27,109 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 38 transitions, 246 flow [2023-11-06 22:10:27,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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-06 22:10:27,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:27,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:27,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:10:27,110 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:27,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:27,111 INFO L85 PathProgramCache]: Analyzing trace with hash 490442860, now seen corresponding path program 1 times [2023-11-06 22:10:27,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:10:27,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708057840] [2023-11-06 22:10:27,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:27,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:10:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:10:27,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:10:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:10:27,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:10:27,241 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:10:27,242 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:10:27,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:10:27,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:10:27,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:10:27,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:10:27,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:10:27,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:10:27,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:10:27,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:10:27,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:10:27,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:10:27,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:10:27,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:10:27,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:10:27,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:10:27,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:10:27,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:10:27,248 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:27,254 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:10:27,255 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:10:27,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:10:27 BasicIcfg [2023-11-06 22:10:27,351 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:10:27,352 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:10:27,352 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:10:27,352 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:10:27,353 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:01" (3/4) ... [2023-11-06 22:10:27,354 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:10:27,355 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:10:27,356 INFO L158 Benchmark]: Toolchain (without parser) took 27357.07ms. Allocated memory was 176.2MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 140.6MB in the beginning and 626.3MB in the end (delta: -485.8MB). Peak memory consumption was 380.2MB. Max. memory is 16.1GB. [2023-11-06 22:10:27,356 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 176.2MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:10:27,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 778.85ms. Allocated memory is still 176.2MB. Free memory was 140.0MB in the beginning and 116.2MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:10:27,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.87ms. Allocated memory is still 176.2MB. Free memory was 116.2MB in the beginning and 113.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:10:27,358 INFO L158 Benchmark]: Boogie Preprocessor took 79.46ms. Allocated memory is still 176.2MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:10:27,358 INFO L158 Benchmark]: RCFGBuilder took 964.95ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 110.9MB in the beginning and 180.3MB in the end (delta: -69.4MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2023-11-06 22:10:27,359 INFO L158 Benchmark]: TraceAbstraction took 25405.75ms. Allocated memory was 213.9MB in the beginning and 1.0GB in the end (delta: 826.3MB). Free memory was 179.3MB in the beginning and 627.4MB in the end (delta: -448.1MB). Peak memory consumption was 378.2MB. Max. memory is 16.1GB. [2023-11-06 22:10:27,359 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 1.0GB. Free memory was 627.4MB in the beginning and 626.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:10:27,362 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 176.2MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 778.85ms. Allocated memory is still 176.2MB. Free memory was 140.0MB in the beginning and 116.2MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.87ms. Allocated memory is still 176.2MB. Free memory was 116.2MB in the beginning and 113.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.46ms. Allocated memory is still 176.2MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 964.95ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 110.9MB in the beginning and 180.3MB in the end (delta: -69.4MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25405.75ms. Allocated memory was 213.9MB in the beginning and 1.0GB in the end (delta: 826.3MB). Free memory was 179.3MB in the beginning and 627.4MB in the end (delta: -448.1MB). Peak memory consumption was 378.2MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 1.0GB. Free memory was 627.4MB in the beginning and 626.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 156 PlacesBefore, 50 PlacesAfterwards, 146 TransitionsBefore, 38 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 148 TotalNumberOfCompositions, 9206 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4555, independent: 4360, independent conditional: 0, independent unconditional: 4360, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2030, independent: 1989, independent conditional: 0, independent unconditional: 1989, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4555, independent: 2371, independent conditional: 0, independent unconditional: 2371, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 2030, unknown conditional: 0, unknown unconditional: 2030] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 139, Positive conditional cache size: 0, Positive unconditional cache size: 139, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t181; [L870] FCALL, FORK 0 pthread_create(&t181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t181, ((void *)0), P0, ((void *)0))=-3, t181={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t182; [L872] FCALL, FORK 0 pthread_create(&t182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t182, ((void *)0), P1, ((void *)0))=-2, t181={5:0}, t182={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t183; [L874] FCALL, FORK 0 pthread_create(&t183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t183, ((void *)0), P2, ((void *)0))=-1, t181={5:0}, t182={6:0}, t183={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t184; [L876] FCALL, FORK 0 pthread_create(&t184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t184, ((void *)0), P3, ((void *)0))=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix007.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 675 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 514 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1852 IncrementalHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 91 mSDtfsCounter, 1852 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=10, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 1176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:10:27,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix007.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:10:29,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:10:30,016 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:10:30,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:10:30,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:10:30,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:10:30,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:10:30,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:10:30,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:10:30,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:10:30,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:10:30,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:10:30,101 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:10:30,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:10:30,103 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:10:30,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:10:30,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:10:30,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:10:30,105 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:10:30,106 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:10:30,107 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:10:30,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:10:30,108 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:10:30,108 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:10:30,109 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:10:30,109 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:10:30,110 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:10:30,110 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:10:30,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:10:30,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:10:30,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:10:30,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:30,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:10:30,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:10:30,114 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:10:30,115 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:10:30,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:10:30,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:10:30,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:10:30,117 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:10:30,117 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:10:30,117 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_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f [2023-11-06 22:10:30,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:10:30,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:10:30,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:10:30,539 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:10:30,539 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:10:30,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix007.opt.i [2023-11-06 22:10:33,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:10:34,027 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:10:34,028 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/sv-benchmarks/c/pthread-wmm/mix007.opt.i [2023-11-06 22:10:34,046 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/data/c37b254ca/3774ed23bc5045e4a4601c467cef7a57/FLAGfb1aebd00 [2023-11-06 22:10:34,066 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/data/c37b254ca/3774ed23bc5045e4a4601c467cef7a57 [2023-11-06 22:10:34,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:10:34,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:10:34,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:34,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:10:34,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:10:34,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f959f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34, skipping insertion in model container [2023-11-06 22:10:34,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,148 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:10:34,625 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:34,644 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:10:34,749 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:10:34,822 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:10:34,823 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:10:34,830 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:10:34,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34 WrapperNode [2023-11-06 22:10:34,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:10:34,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:34,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:10:34,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:10:34,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,915 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 172 [2023-11-06 22:10:34,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:10:34,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:10:34,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:10:34,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:10:34,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:10:34,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:10:34,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:10:34,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:10:34,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (1/1) ... [2023-11-06 22:10:34,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:10:34,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:10:35,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:10:35,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:10:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:10:35,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:10:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:10:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:10:35,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:10:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:10:35,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:10:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:10:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:10:35,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:10:35,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:10:35,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:10:35,060 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:10:35,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:10:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:10:35,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:10:35,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:10:35,063 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:10:35,266 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:10:35,268 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:10:35,684 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:10:35,830 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:10:35,830 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:10:35,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:35 BoogieIcfgContainer [2023-11-06 22:10:35,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:10:35,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:10:35,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:10:35,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:10:35,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:10:34" (1/3) ... [2023-11-06 22:10:35,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1227a839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:35, skipping insertion in model container [2023-11-06 22:10:35,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:10:34" (2/3) ... [2023-11-06 22:10:35,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1227a839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:10:35, skipping insertion in model container [2023-11-06 22:10:35,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:35" (3/3) ... [2023-11-06 22:10:35,849 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.opt.i [2023-11-06 22:10:35,869 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:10:35,870 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:10:35,870 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:10:35,976 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:10:36,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:10:36,093 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:10:36,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:10:36,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:10:36,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:10:36,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 147 transitions, 306 flow [2023-11-06 22:10:36,113 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:10:36,128 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:10:36,133 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:10:36,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 306 flow [2023-11-06 22:10:36,205 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:10:36,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:10:36,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:10:36,214 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-11-06 22:10:47,013 INFO L134 LiptonReduction]: Checked pairs total: 9194 [2023-11-06 22:10:47,013 INFO L136 LiptonReduction]: Total number of compositions: 149 [2023-11-06 22:10:47,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:10:47,037 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;@78cf81b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:10:47,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:10:47,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:10:47,039 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:10:47,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:10:47,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:47,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:10:47,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:47,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash 667, now seen corresponding path program 1 times [2023-11-06 22:10:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:47,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465966052] [2023-11-06 22:10:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:47,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:47,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:47,073 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:10:47,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:10:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:47,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:10:47,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:47,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:47,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:47,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465966052] [2023-11-06 22:10:47,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465966052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:47,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:47,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:10:47,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470766239] [2023-11-06 22:10:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:47,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:10:47,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:10:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:10:47,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 300 [2023-11-06 22:10:47,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:47,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:47,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 300 [2023-11-06 22:10:47,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:48,568 INFO L124 PetriNetUnfolderBase]: 4373/6061 cut-off events. [2023-11-06 22:10:48,569 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-06 22:10:48,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12147 conditions, 6061 events. 4373/6061 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 30923 event pairs, 4373 based on Foata normal form. 0/5319 useless extension candidates. Maximal degree in co-relation 12135. Up to 5983 conditions per place. [2023-11-06 22:10:48,634 INFO L140 encePairwiseOnDemand]: 291/300 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-11-06 22:10:48,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-11-06 22:10:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:10:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:10:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-11-06 22:10:48,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2023-11-06 22:10:48,658 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-11-06 22:10:48,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-11-06 22:10:48,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:48,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-11-06 22:10:48,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:48,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:48,677 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:48,679 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 309 transitions. [2023-11-06 22:10:48,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-11-06 22:10:48,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:10:48,689 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-11-06 22:10:48,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-06 22:10:48,695 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-11-06 22:10:48,696 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-11-06 22:10:48,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:48,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:48,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:48,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:48,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:48,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:48,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash 714882577, now seen corresponding path program 1 times [2023-11-06 22:10:48,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:48,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598573999] [2023-11-06 22:10:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:48,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:48,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:48,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:10:48,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:10:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:49,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:10:49,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:49,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:49,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598573999] [2023-11-06 22:10:49,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598573999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:49,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:49,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:10:49,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276704299] [2023-11-06 22:10:49,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:49,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:10:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:49,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:10:49,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:10:49,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 300 [2023-11-06 22:10:49,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:49,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:49,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 300 [2023-11-06 22:10:49,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:50,067 INFO L124 PetriNetUnfolderBase]: 3632/5266 cut-off events. [2023-11-06 22:10:50,067 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:10:50,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10356 conditions, 5266 events. 3632/5266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 29373 event pairs, 668 based on Foata normal form. 0/4893 useless extension candidates. Maximal degree in co-relation 10353. Up to 3973 conditions per place. [2023-11-06 22:10:50,108 INFO L140 encePairwiseOnDemand]: 297/300 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-06 22:10:50,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2023-11-06 22:10:50,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:10:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:10:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-11-06 22:10:50,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49666666666666665 [2023-11-06 22:10:50,112 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-11-06 22:10:50,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-11-06 22:10:50,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:50,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-11-06 22:10:50,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:50,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:50,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 300.0) internal successors, (1200), 4 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:50,119 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 447 transitions. [2023-11-06 22:10:50,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2023-11-06 22:10:50,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:10:50,121 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-11-06 22:10:50,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-06 22:10:50,122 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-11-06 22:10:50,122 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-11-06 22:10:50,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:50,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:50,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:50,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:50,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:50,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:50,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1674457823, now seen corresponding path program 1 times [2023-11-06 22:10:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:50,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503040793] [2023-11-06 22:10:50,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:50,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:50,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:50,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:10:50,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:10:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:50,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:10:50,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:50,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:50,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:50,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503040793] [2023-11-06 22:10:50,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503040793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:50,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:50,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:50,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2239512] [2023-11-06 22:10:50,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:50,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:50,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:50,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 300 [2023-11-06 22:10:50,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:50,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:50,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 300 [2023-11-06 22:10:50,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:51,398 INFO L124 PetriNetUnfolderBase]: 2540/3682 cut-off events. [2023-11-06 22:10:51,398 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-06 22:10:51,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7634 conditions, 3682 events. 2540/3682 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 18787 event pairs, 492 based on Foata normal form. 180/3723 useless extension candidates. Maximal degree in co-relation 7630. Up to 2887 conditions per place. [2023-11-06 22:10:51,430 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 36 selfloop transitions, 5 changer transitions 23/68 dead transitions. [2023-11-06 22:10:51,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 288 flow [2023-11-06 22:10:51,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:10:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 716 transitions. [2023-11-06 22:10:51,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47733333333333333 [2023-11-06 22:10:51,435 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 716 transitions. [2023-11-06 22:10:51,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 716 transitions. [2023-11-06 22:10:51,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:51,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 716 transitions. [2023-11-06 22:10:51,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:51,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:51,446 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:51,446 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 716 transitions. [2023-11-06 22:10:51,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 288 flow [2023-11-06 22:10:51,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:10:51,450 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 109 flow [2023-11-06 22:10:51,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-11-06 22:10:51,452 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-11-06 22:10:51,452 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 109 flow [2023-11-06 22:10:51,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:51,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:51,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:51,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:51,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:51,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:51,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:51,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1954370488, now seen corresponding path program 1 times [2023-11-06 22:10:51,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:51,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334783144] [2023-11-06 22:10:51,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:51,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:51,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:51,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:10:51,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:10:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:51,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:10:51,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:51,868 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:51,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334783144] [2023-11-06 22:10:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334783144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:51,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427273174] [2023-11-06 22:10:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:51,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:10:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:10:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:51,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 300 [2023-11-06 22:10:51,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:51,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:51,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 300 [2023-11-06 22:10:51,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:52,465 INFO L124 PetriNetUnfolderBase]: 1284/1998 cut-off events. [2023-11-06 22:10:52,465 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2023-11-06 22:10:52,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5503 conditions, 1998 events. 1284/1998 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9787 event pairs, 186 based on Foata normal form. 132/2067 useless extension candidates. Maximal degree in co-relation 5496. Up to 1027 conditions per place. [2023-11-06 22:10:52,484 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 47 selfloop transitions, 9 changer transitions 23/83 dead transitions. [2023-11-06 22:10:52,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 429 flow [2023-11-06 22:10:52,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:10:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:10:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 861 transitions. [2023-11-06 22:10:52,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47833333333333333 [2023-11-06 22:10:52,489 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 861 transitions. [2023-11-06 22:10:52,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 861 transitions. [2023-11-06 22:10:52,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:52,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 861 transitions. [2023-11-06 22:10:52,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:52,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:52,499 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:52,500 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 109 flow. Second operand 6 states and 861 transitions. [2023-11-06 22:10:52,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 429 flow [2023-11-06 22:10:52,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:10:52,510 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 174 flow [2023-11-06 22:10:52,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-11-06 22:10:52,511 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-11-06 22:10:52,511 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 174 flow [2023-11-06 22:10:52,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:52,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:52,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:52,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:52,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:52,724 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:52,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:52,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1005249652, now seen corresponding path program 1 times [2023-11-06 22:10:52,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865125006] [2023-11-06 22:10:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:52,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:52,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:52,726 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:10:52,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:10:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:52,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:10:52,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:52,950 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:52,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:52,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865125006] [2023-11-06 22:10:52,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865125006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:52,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:52,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:10:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632707676] [2023-11-06 22:10:52,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:52,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:52,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:10:52,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 300 [2023-11-06 22:10:52,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:52,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:52,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 300 [2023-11-06 22:10:52,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:53,542 INFO L124 PetriNetUnfolderBase]: 660/1078 cut-off events. [2023-11-06 22:10:53,542 INFO L125 PetriNetUnfolderBase]: For 1228/1228 co-relation queries the response was YES. [2023-11-06 22:10:53,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 1078 events. 660/1078 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4732 event pairs, 124 based on Foata normal form. 56/1115 useless extension candidates. Maximal degree in co-relation 3495. Up to 395 conditions per place. [2023-11-06 22:10:53,552 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 56 selfloop transitions, 13 changer transitions 23/96 dead transitions. [2023-11-06 22:10:53,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 590 flow [2023-11-06 22:10:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:10:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:10:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1004 transitions. [2023-11-06 22:10:53,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4780952380952381 [2023-11-06 22:10:53,557 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1004 transitions. [2023-11-06 22:10:53,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1004 transitions. [2023-11-06 22:10:53,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:53,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1004 transitions. [2023-11-06 22:10:53,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.42857142857142) internal successors, (1004), 7 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:53,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:53,568 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:53,568 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 174 flow. Second operand 7 states and 1004 transitions. [2023-11-06 22:10:53,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 590 flow [2023-11-06 22:10:53,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 528 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-06 22:10:53,585 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 224 flow [2023-11-06 22:10:53,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-11-06 22:10:53,587 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-11-06 22:10:53,587 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 224 flow [2023-11-06 22:10:53,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:53,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:53,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:53,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:53,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:53,800 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:53,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:53,801 INFO L85 PathProgramCache]: Analyzing trace with hash -363676704, now seen corresponding path program 1 times [2023-11-06 22:10:53,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:53,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821275510] [2023-11-06 22:10:53,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:53,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:53,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:53,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:10:53,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:10:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:53,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:10:53,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:54,040 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:54,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:54,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821275510] [2023-11-06 22:10:54,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821275510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:54,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:54,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:10:54,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40746448] [2023-11-06 22:10:54,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:54,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:10:54,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:54,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:10:54,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:10:54,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 300 [2023-11-06 22:10:54,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:54,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:54,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 300 [2023-11-06 22:10:54,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:54,690 INFO L124 PetriNetUnfolderBase]: 528/847 cut-off events. [2023-11-06 22:10:54,690 INFO L125 PetriNetUnfolderBase]: For 938/938 co-relation queries the response was YES. [2023-11-06 22:10:54,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2647 conditions, 847 events. 528/847 cut-off events. For 938/938 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3560 event pairs, 119 based on Foata normal form. 12/851 useless extension candidates. Maximal degree in co-relation 2637. Up to 340 conditions per place. [2023-11-06 22:10:54,698 INFO L140 encePairwiseOnDemand]: 293/300 looper letters, 52 selfloop transitions, 17 changer transitions 12/85 dead transitions. [2023-11-06 22:10:54,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 534 flow [2023-11-06 22:10:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:10:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:10:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1123 transitions. [2023-11-06 22:10:54,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46791666666666665 [2023-11-06 22:10:54,703 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1123 transitions. [2023-11-06 22:10:54,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1123 transitions. [2023-11-06 22:10:54,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:54,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1123 transitions. [2023-11-06 22:10:54,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.375) internal successors, (1123), 8 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:54,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 300.0) internal successors, (2700), 9 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:54,713 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 300.0) internal successors, (2700), 9 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:54,713 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 224 flow. Second operand 8 states and 1123 transitions. [2023-11-06 22:10:54,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 534 flow [2023-11-06 22:10:54,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-06 22:10:54,729 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 218 flow [2023-11-06 22:10:54,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-11-06 22:10:54,730 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-11-06 22:10:54,730 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 218 flow [2023-11-06 22:10:54,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:54,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:54,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:54,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:54,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:54,943 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:54,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:54,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1459211006, now seen corresponding path program 1 times [2023-11-06 22:10:54,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:54,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518241531] [2023-11-06 22:10:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:54,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:54,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:54,946 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:10:54,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:10:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:55,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:10:55,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:55,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:55,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518241531] [2023-11-06 22:10:55,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518241531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:55,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:55,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:55,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355041172] [2023-11-06 22:10:55,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:55,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:10:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:55,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:10:55,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:10:56,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 300 [2023-11-06 22:10:56,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:56,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:56,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 300 [2023-11-06 22:10:56,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:56,868 INFO L124 PetriNetUnfolderBase]: 518/845 cut-off events. [2023-11-06 22:10:56,868 INFO L125 PetriNetUnfolderBase]: For 1350/1350 co-relation queries the response was YES. [2023-11-06 22:10:56,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2578 conditions, 845 events. 518/845 cut-off events. For 1350/1350 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3953 event pairs, 9 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 2567. Up to 670 conditions per place. [2023-11-06 22:10:56,876 INFO L140 encePairwiseOnDemand]: 295/300 looper letters, 52 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2023-11-06 22:10:56,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 451 flow [2023-11-06 22:10:56,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:10:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:10:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2023-11-06 22:10:56,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4072222222222222 [2023-11-06 22:10:56,881 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2023-11-06 22:10:56,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2023-11-06 22:10:56,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:56,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2023-11-06 22:10:56,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:56,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:56,888 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 300.0) internal successors, (2100), 7 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:56,888 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 218 flow. Second operand 6 states and 733 transitions. [2023-11-06 22:10:56,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 451 flow [2023-11-06 22:10:56,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 362 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-11-06 22:10:56,893 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 160 flow [2023-11-06 22:10:56,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-11-06 22:10:56,894 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-11-06 22:10:56,894 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 160 flow [2023-11-06 22:10:56,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:56,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:56,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:56,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:57,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:57,113 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:57,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1588664923, now seen corresponding path program 1 times [2023-11-06 22:10:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:57,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288588602] [2023-11-06 22:10:57,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:10:57,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:57,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:57,116 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:10:57,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:10:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:10:57,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:10:57,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:57,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:57,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:57,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288588602] [2023-11-06 22:10:57,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288588602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:57,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:57,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:10:57,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964371431] [2023-11-06 22:10:57,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:57,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:10:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:57,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:10:57,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:10:57,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 300 [2023-11-06 22:10:57,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:57,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:57,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 300 [2023-11-06 22:10:57,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:57,701 INFO L124 PetriNetUnfolderBase]: 932/1482 cut-off events. [2023-11-06 22:10:57,701 INFO L125 PetriNetUnfolderBase]: For 1022/1022 co-relation queries the response was YES. [2023-11-06 22:10:57,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4187 conditions, 1482 events. 932/1482 cut-off events. For 1022/1022 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7448 event pairs, 443 based on Foata normal form. 1/1464 useless extension candidates. Maximal degree in co-relation 4179. Up to 890 conditions per place. [2023-11-06 22:10:57,710 INFO L140 encePairwiseOnDemand]: 296/300 looper letters, 51 selfloop transitions, 2 changer transitions 12/68 dead transitions. [2023-11-06 22:10:57,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 420 flow [2023-11-06 22:10:57,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:10:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:10:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-11-06 22:10:57,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-11-06 22:10:57,713 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-11-06 22:10:57,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-11-06 22:10:57,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:57,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-11-06 22:10:57,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:57,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:57,719 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 300.0) internal successors, (1500), 5 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:57,720 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 160 flow. Second operand 4 states and 570 transitions. [2023-11-06 22:10:57,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 420 flow [2023-11-06 22:10:57,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 410 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:10:57,730 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 163 flow [2023-11-06 22:10:57,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-11-06 22:10:57,732 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-11-06 22:10:57,732 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 163 flow [2023-11-06 22:10:57,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:57,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:57,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:57,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:57,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:57,945 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:57,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2076446505, now seen corresponding path program 2 times [2023-11-06 22:10:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:57,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005689211] [2023-11-06 22:10:57,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:10:57,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:57,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:57,953 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:10:57,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:10:58,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:10:58,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:58,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:10:58,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:58,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:58,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:58,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005689211] [2023-11-06 22:10:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005689211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:58,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617934562] [2023-11-06 22:10:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:58,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:10:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:58,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:10:58,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:58,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 300 [2023-11-06 22:10:58,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:58,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:58,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 300 [2023-11-06 22:10:58,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:58,560 INFO L124 PetriNetUnfolderBase]: 485/823 cut-off events. [2023-11-06 22:10:58,560 INFO L125 PetriNetUnfolderBase]: For 725/727 co-relation queries the response was YES. [2023-11-06 22:10:58,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2529 conditions, 823 events. 485/823 cut-off events. For 725/727 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3792 event pairs, 95 based on Foata normal form. 2/822 useless extension candidates. Maximal degree in co-relation 2519. Up to 472 conditions per place. [2023-11-06 22:10:58,565 INFO L140 encePairwiseOnDemand]: 296/300 looper letters, 48 selfloop transitions, 1 changer transitions 32/84 dead transitions. [2023-11-06 22:10:58,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 84 transitions, 530 flow [2023-11-06 22:10:58,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:10:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 707 transitions. [2023-11-06 22:10:58,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713333333333333 [2023-11-06 22:10:58,570 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 707 transitions. [2023-11-06 22:10:58,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 707 transitions. [2023-11-06 22:10:58,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:58,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 707 transitions. [2023-11-06 22:10:58,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.4) internal successors, (707), 5 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:58,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:58,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:58,577 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 163 flow. Second operand 5 states and 707 transitions. [2023-11-06 22:10:58,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 84 transitions, 530 flow [2023-11-06 22:10:58,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 516 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 22:10:58,585 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 164 flow [2023-11-06 22:10:58,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-11-06 22:10:58,586 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-11-06 22:10:58,586 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 164 flow [2023-11-06 22:10:58,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:58,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:58,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:58,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:58,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:58,800 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:58,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1830034871, now seen corresponding path program 3 times [2023-11-06 22:10:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:58,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997544207] [2023-11-06 22:10:58,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:10:58,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:58,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:58,803 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:10:58,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:10:58,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:10:58,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:58,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:10:58,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:10:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:10:59,064 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:10:59,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:10:59,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997544207] [2023-11-06 22:10:59,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997544207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:10:59,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:10:59,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:10:59,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378870720] [2023-11-06 22:10:59,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:10:59,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:10:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:10:59,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:10:59,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:10:59,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 300 [2023-11-06 22:10:59,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:59,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:10:59,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 300 [2023-11-06 22:10:59,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:10:59,502 INFO L124 PetriNetUnfolderBase]: 735/1281 cut-off events. [2023-11-06 22:10:59,502 INFO L125 PetriNetUnfolderBase]: For 1280/1280 co-relation queries the response was YES. [2023-11-06 22:10:59,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3792 conditions, 1281 events. 735/1281 cut-off events. For 1280/1280 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6428 event pairs, 91 based on Foata normal form. 1/1268 useless extension candidates. Maximal degree in co-relation 3781. Up to 705 conditions per place. [2023-11-06 22:10:59,506 INFO L140 encePairwiseOnDemand]: 296/300 looper letters, 40 selfloop transitions, 1 changer transitions 36/80 dead transitions. [2023-11-06 22:10:59,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 496 flow [2023-11-06 22:10:59,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:10:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:10:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 707 transitions. [2023-11-06 22:10:59,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713333333333333 [2023-11-06 22:10:59,511 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 707 transitions. [2023-11-06 22:10:59,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 707 transitions. [2023-11-06 22:10:59,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:10:59,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 707 transitions. [2023-11-06 22:10:59,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.4) internal successors, (707), 5 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:59,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:59,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:59,520 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 164 flow. Second operand 5 states and 707 transitions. [2023-11-06 22:10:59,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 496 flow [2023-11-06 22:10:59,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 488 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 22:10:59,531 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 168 flow [2023-11-06 22:10:59,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2023-11-06 22:10:59,532 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-11-06 22:10:59,532 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 168 flow [2023-11-06 22:10:59,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:10:59,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:10:59,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:10:59,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:10:59,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:59,746 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:10:59,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:10:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2133497969, now seen corresponding path program 4 times [2023-11-06 22:10:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:10:59,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973891511] [2023-11-06 22:10:59,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:10:59,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:10:59,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:10:59,748 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:10:59,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-06 22:10:59,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:10:59,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:10:59,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:10:59,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:11:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:11:00,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:11:00,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:11:00,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973891511] [2023-11-06 22:11:00,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973891511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:11:00,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:11:00,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:11:00,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505912480] [2023-11-06 22:11:00,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:11:00,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:11:00,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:11:00,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:11:00,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:11:01,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 300 [2023-11-06 22:11:01,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 168 flow. Second operand has 8 states, 8 states have (on average 131.875) internal successors, (1055), 8 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:01,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:11:01,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 300 [2023-11-06 22:11:01,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:11:01,585 INFO L124 PetriNetUnfolderBase]: 489/865 cut-off events. [2023-11-06 22:11:01,585 INFO L125 PetriNetUnfolderBase]: For 1037/1041 co-relation queries the response was YES. [2023-11-06 22:11:01,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2721 conditions, 865 events. 489/865 cut-off events. For 1037/1041 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4035 event pairs, 162 based on Foata normal form. 1/844 useless extension candidates. Maximal degree in co-relation 2709. Up to 318 conditions per place. [2023-11-06 22:11:01,589 INFO L140 encePairwiseOnDemand]: 292/300 looper letters, 39 selfloop transitions, 5 changer transitions 50/98 dead transitions. [2023-11-06 22:11:01,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 668 flow [2023-11-06 22:11:01,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:11:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:11:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1214 transitions. [2023-11-06 22:11:01,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44962962962962966 [2023-11-06 22:11:01,595 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1214 transitions. [2023-11-06 22:11:01,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1214 transitions. [2023-11-06 22:11:01,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:11:01,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1214 transitions. [2023-11-06 22:11:01,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.88888888888889) internal successors, (1214), 9 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:01,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 300.0) internal successors, (3000), 10 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:01,607 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 300.0) internal successors, (3000), 10 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:01,607 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 168 flow. Second operand 9 states and 1214 transitions. [2023-11-06 22:11:01,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 668 flow [2023-11-06 22:11:01,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 658 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 22:11:01,613 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 181 flow [2023-11-06 22:11:01,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=300, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=181, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2023-11-06 22:11:01,614 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-11-06 22:11:01,615 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 181 flow [2023-11-06 22:11:01,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 131.875) internal successors, (1055), 8 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:11:01,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:11:01,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:01,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:11:01,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:11:01,825 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:11:01,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:11:01,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1124208405, now seen corresponding path program 5 times [2023-11-06 22:11:01,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:11:01,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993186985] [2023-11-06 22:11:01,826 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:11:01,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:11:01,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:11:01,827 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:11:01,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-06 22:11:02,031 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:11:02,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:11:02,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:11:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:11:02,242 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:11:02,243 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:11:02,244 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:11:02,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:11:02,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:11:02,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:11:02,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:11:02,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:11:02,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:11:02,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:11:02,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:11:02,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:11:02,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:11:02,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:11:02,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:11:02,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:11:02,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:11:02,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:11:02,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:11:02,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:11:02,467 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:11:02,471 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:11:02,472 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:11:02,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:11:02 BasicIcfg [2023-11-06 22:11:02,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:11:02,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:11:02,601 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:11:02,601 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:11:02,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:10:35" (3/4) ... [2023-11-06 22:11:02,603 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:11:02,604 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:11:02,605 INFO L158 Benchmark]: Toolchain (without parser) took 28535.05ms. Allocated memory was 86.0MB in the beginning and 629.1MB in the end (delta: 543.2MB). Free memory was 60.2MB in the beginning and 289.5MB in the end (delta: -229.2MB). Peak memory consumption was 316.6MB. Max. memory is 16.1GB. [2023-11-06 22:11:02,606 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 86.0MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:11:02,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 759.91ms. Allocated memory is still 86.0MB. Free memory was 60.0MB in the beginning and 60.6MB in the end (delta: -621.9kB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2023-11-06 22:11:02,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.33ms. Allocated memory is still 86.0MB. Free memory was 60.6MB in the beginning and 57.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:11:02,607 INFO L158 Benchmark]: Boogie Preprocessor took 39.72ms. Allocated memory is still 86.0MB. Free memory was 57.7MB in the beginning and 55.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:11:02,607 INFO L158 Benchmark]: RCFGBuilder took 876.57ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 55.4MB in the beginning and 64.2MB in the end (delta: -8.8MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2023-11-06 22:11:02,608 INFO L158 Benchmark]: TraceAbstraction took 26764.10ms. Allocated memory was 119.5MB in the beginning and 629.1MB in the end (delta: 509.6MB). Free memory was 63.6MB in the beginning and 290.5MB in the end (delta: -226.9MB). Peak memory consumption was 282.8MB. Max. memory is 16.1GB. [2023-11-06 22:11:02,608 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 629.1MB. Free memory was 290.5MB in the beginning and 289.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:11:02,613 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 86.0MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 759.91ms. Allocated memory is still 86.0MB. Free memory was 60.0MB in the beginning and 60.6MB in the end (delta: -621.9kB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.33ms. Allocated memory is still 86.0MB. Free memory was 60.6MB in the beginning and 57.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.72ms. Allocated memory is still 86.0MB. Free memory was 57.7MB in the beginning and 55.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 876.57ms. Allocated memory was 86.0MB in the beginning and 119.5MB in the end (delta: 33.6MB). Free memory was 55.4MB in the beginning and 64.2MB in the end (delta: -8.8MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26764.10ms. Allocated memory was 119.5MB in the beginning and 629.1MB in the end (delta: 509.6MB). Free memory was 63.6MB in the beginning and 290.5MB in the end (delta: -226.9MB). Peak memory consumption was 282.8MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 629.1MB. Free memory was 290.5MB in the beginning and 289.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.9s, 157 PlacesBefore, 51 PlacesAfterwards, 147 TransitionsBefore, 39 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 149 TotalNumberOfCompositions, 9194 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4455, independent: 4245, independent conditional: 0, independent unconditional: 4245, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1963, independent: 1925, independent conditional: 0, independent unconditional: 1925, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4455, independent: 2320, independent conditional: 0, independent unconditional: 2320, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 1963, unknown conditional: 0, unknown unconditional: 1963] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 145, Positive conditional cache size: 0, Positive unconditional cache size: 145, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t181; [L870] FCALL, FORK 0 pthread_create(&t181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t181, ((void *)0), P0, ((void *)0))=0, t181={-16:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t182; [L872] FCALL, FORK 0 pthread_create(&t182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t182, ((void *)0), P1, ((void *)0))=1, t181={-16:0}, t182={-12:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t183; [L874] FCALL, FORK 0 pthread_create(&t183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t183, ((void *)0), P2, ((void *)0))=2, t181={-16:0}, t182={-12:0}, t183={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t184; [L876] FCALL, FORK 0 pthread_create(&t184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t184, ((void *)0), P3, ((void *)0))=3, t181={-16:0}, t182={-12:0}, t183={-2:0}, t184={-4:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t181={-16:0}, t182={-12:0}, t183={-2:0}, t184={-4:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L889] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix007.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={6:5}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 546 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2298 IncrementalHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 44 mSDtfsCounter, 2298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=5, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 1977 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1707 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:11:02,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f90cb005-080c-466f-9a91-a92117ed6389/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample