./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:56:25,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:56:25,942 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:56:25,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:56:25,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:56:25,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:56:26,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:56:26,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:56:26,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:56:26,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:56:26,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:56:26,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:56:26,011 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:56:26,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:56:26,014 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:56:26,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:56:26,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:56:26,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:56:26,015 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:56:26,016 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:56:26,017 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:56:26,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:56:26,018 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:56:26,018 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:56:26,019 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:56:26,019 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:56:26,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:56:26,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:56:26,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:56:26,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:56:26,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:56:26,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:56:26,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:56:26,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:56:26,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:56:26,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:56:26,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:56:26,023 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:56:26,024 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_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 42c5ff0d69642601057eb29fc7d78b67af5ab0b43644460199f4561abe049d3b [2023-11-19 07:56:26,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:56:26,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:56:26,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:56:26,364 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:56:26,365 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:56:26,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2023-11-19 07:56:29,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:56:29,990 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:56:29,993 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/sv-benchmarks/c/pthread-wmm/mix039.oepc.i [2023-11-19 07:56:30,022 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/data/fff913cda/395fbfd4680c404d96fefec56cab61b4/FLAG35478389e [2023-11-19 07:56:30,044 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/data/fff913cda/395fbfd4680c404d96fefec56cab61b4 [2023-11-19 07:56:30,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:56:30,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:56:30,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:56:30,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:56:30,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:56:30,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2c8673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30, skipping insertion in model container [2023-11-19 07:56:30,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,135 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:56:30,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:56:30,646 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:56:30,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:56:30,822 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:56:30,822 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:56:30,830 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:56:30,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30 WrapperNode [2023-11-19 07:56:30,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:56:30,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:56:30,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:56:30,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:56:30,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,905 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-19 07:56:30,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:56:30,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:56:30,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:56:30,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:56:30,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:56:30,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:56:30,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:56:30,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:56:30,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (1/1) ... [2023-11-19 07:56:30,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:56:30,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:56:31,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:56:31,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081c6d2e-0fc7-46a8-8a03-ce993ba5ff5d/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:56:31,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:56:31,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:56:31,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:56:31,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:56:31,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:56:31,073 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:56:31,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:56:31,073 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:56:31,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:56:31,075 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:56:31,075 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:56:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:56:31,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:56:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:56:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:56:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:56:31,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:56:31,081 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:56:31,341 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:56:31,346 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:56:31,843 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:56:32,026 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:56:32,027 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:56:32,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:32 BoogieIcfgContainer [2023-11-19 07:56:32,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:56:32,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:56:32,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:56:32,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:56:32,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:56:30" (1/3) ... [2023-11-19 07:56:32,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3061fb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:56:32, skipping insertion in model container [2023-11-19 07:56:32,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:30" (2/3) ... [2023-11-19 07:56:32,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3061fb65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:56:32, skipping insertion in model container [2023-11-19 07:56:32,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:32" (3/3) ... [2023-11-19 07:56:32,049 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2023-11-19 07:56:32,067 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:56:32,067 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 07:56:32,068 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:56:32,160 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:56:32,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 154 transitions, 324 flow [2023-11-19 07:56:32,279 INFO L124 PetriNetUnfolderBase]: 4/150 cut-off events. [2023-11-19 07:56:32,279 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:56:32,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 4/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 122 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-11-19 07:56:32,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 154 transitions, 324 flow [2023-11-19 07:56:32,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 150 transitions, 312 flow [2023-11-19 07:56:32,302 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:56:32,314 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 150 transitions, 312 flow [2023-11-19 07:56:32,317 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 150 transitions, 312 flow [2023-11-19 07:56:32,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 150 transitions, 312 flow [2023-11-19 07:56:32,371 INFO L124 PetriNetUnfolderBase]: 4/150 cut-off events. [2023-11-19 07:56:32,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:56:32,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 4/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 122 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-11-19 07:56:32,378 INFO L119 LiptonReduction]: Number of co-enabled transitions 4380 [2023-11-19 07:56:39,295 INFO L134 LiptonReduction]: Checked pairs total: 10290 [2023-11-19 07:56:39,295 INFO L136 LiptonReduction]: Total number of compositions: 152 [2023-11-19 07:56:39,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:56:39,343 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;@32314625, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:56:39,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 07:56:39,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:56:39,345 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:56:39,345 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:56:39,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:56:39,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:56:39,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:56:39,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:39,356 INFO L85 PathProgramCache]: Analyzing trace with hash 669, now seen corresponding path program 1 times [2023-11-19 07:56:39,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:39,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967002827] [2023-11-19 07:56:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:39,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:56:39,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:39,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967002827] [2023-11-19 07:56:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967002827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:39,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:39,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:56:39,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484209629] [2023-11-19 07:56:39,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:39,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:56:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:39,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:56:39,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:56:39,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 306 [2023-11-19 07:56:39,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 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-19 07:56:39,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:56:39,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 306 [2023-11-19 07:56:39,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:56:42,336 INFO L124 PetriNetUnfolderBase]: 7479/10245 cut-off events. [2023-11-19 07:56:42,336 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-19 07:56:42,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20553 conditions, 10245 events. 7479/10245 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 53353 event pairs, 7479 based on Foata normal form. 0/8832 useless extension candidates. Maximal degree in co-relation 20541. Up to 10091 conditions per place. [2023-11-19 07:56:42,469 INFO L140 encePairwiseOnDemand]: 298/306 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-19 07:56:42,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-11-19 07:56:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:56:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:56:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-11-19 07:56:42,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049019607843137 [2023-11-19 07:56:42,499 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-11-19 07:56:42,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-11-19 07:56:42,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:56:42,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-11-19 07:56:42,517 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-19 07:56:42,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:42,525 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:42,527 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 309 transitions. [2023-11-19 07:56:42,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-11-19 07:56:42,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:56:42,540 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-19 07:56:42,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-19 07:56:42,549 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-19 07:56:42,550 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-19 07:56:42,550 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-19 07:56:42,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:56:42,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 07:56:42,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:56:42,551 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:56:42,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:42,552 INFO L85 PathProgramCache]: Analyzing trace with hash 659328, now seen corresponding path program 1 times [2023-11-19 07:56:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:42,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346116888] [2023-11-19 07:56:42,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:42,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:56:42,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:42,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346116888] [2023-11-19 07:56:42,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346116888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:42,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:42,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:56:42,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155355480] [2023-11-19 07:56:42,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:42,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:56:42,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:42,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:56:42,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:56:42,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 306 [2023-11-19 07:56:42,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:42,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:56:42,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 306 [2023-11-19 07:56:42,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:56:44,936 INFO L124 PetriNetUnfolderBase]: 5879/8521 cut-off events. [2023-11-19 07:56:44,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:56:44,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16662 conditions, 8521 events. 5879/8521 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 51182 event pairs, 1079 based on Foata normal form. 0/7863 useless extension candidates. Maximal degree in co-relation 16659. Up to 6367 conditions per place. [2023-11-19 07:56:45,119 INFO L140 encePairwiseOnDemand]: 303/306 looper letters, 43 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2023-11-19 07:56:45,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 210 flow [2023-11-19 07:56:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:56:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:56:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2023-11-19 07:56:45,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49673202614379086 [2023-11-19 07:56:45,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2023-11-19 07:56:45,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2023-11-19 07:56:45,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:56:45,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2023-11-19 07:56:45,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:45,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:45,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:45,142 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 456 transitions. [2023-11-19 07:56:45,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 210 flow [2023-11-19 07:56:45,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:56:45,147 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-19 07:56:45,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-19 07:56:45,150 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-19 07:56:45,150 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-19 07:56:45,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:45,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:56:45,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:45,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:56:45,160 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:56:45,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash -892833168, now seen corresponding path program 1 times [2023-11-19 07:56:45,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:45,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317273751] [2023-11-19 07:56:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:45,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:56:45,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:45,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317273751] [2023-11-19 07:56:45,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317273751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:45,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:45,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:56:45,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334992512] [2023-11-19 07:56:45,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:45,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:56:45,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:45,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:56:45,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:56:45,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 306 [2023-11-19 07:56:45,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:45,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:56:45,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 306 [2023-11-19 07:56:45,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:56:50,823 INFO L124 PetriNetUnfolderBase]: 18905/25584 cut-off events. [2023-11-19 07:56:50,824 INFO L125 PetriNetUnfolderBase]: For 1301/1301 co-relation queries the response was YES. [2023-11-19 07:56:50,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52943 conditions, 25584 events. 18905/25584 cut-off events. For 1301/1301 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 136774 event pairs, 6836 based on Foata normal form. 0/24854 useless extension candidates. Maximal degree in co-relation 52939. Up to 16530 conditions per place. [2023-11-19 07:56:51,082 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2023-11-19 07:56:51,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 240 flow [2023-11-19 07:56:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:56:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:56:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-11-19 07:56:51,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4760348583877996 [2023-11-19 07:56:51,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-11-19 07:56:51,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-11-19 07:56:51,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:56:51,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-11-19 07:56:51,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:51,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:51,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:51,098 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 437 transitions. [2023-11-19 07:56:51,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 240 flow [2023-11-19 07:56:51,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:56:51,103 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 128 flow [2023-11-19 07:56:51,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-19 07:56:51,106 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-11-19 07:56:51,106 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 128 flow [2023-11-19 07:56:51,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:51,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:56:51,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:51,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:56:51,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:56:51,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:51,115 INFO L85 PathProgramCache]: Analyzing trace with hash -892833161, now seen corresponding path program 1 times [2023-11-19 07:56:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:51,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683778908] [2023-11-19 07:56:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:56:52,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:52,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683778908] [2023-11-19 07:56:52,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683778908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:52,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:52,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:56:52,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424683051] [2023-11-19 07:56:52,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:52,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:56:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:52,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:56:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:56:52,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 306 [2023-11-19 07:56:52,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 128 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-19 07:56:52,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:56:52,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 306 [2023-11-19 07:56:52,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:56:56,053 INFO L124 PetriNetUnfolderBase]: 12839/18060 cut-off events. [2023-11-19 07:56:56,053 INFO L125 PetriNetUnfolderBase]: For 5017/5084 co-relation queries the response was YES. [2023-11-19 07:56:56,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42684 conditions, 18060 events. 12839/18060 cut-off events. For 5017/5084 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 102060 event pairs, 1677 based on Foata normal form. 498/18369 useless extension candidates. Maximal degree in co-relation 42679. Up to 13127 conditions per place. [2023-11-19 07:56:56,230 INFO L140 encePairwiseOnDemand]: 299/306 looper letters, 55 selfloop transitions, 6 changer transitions 0/67 dead transitions. [2023-11-19 07:56:56,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 324 flow [2023-11-19 07:56:56,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:56:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:56:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2023-11-19 07:56:56,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199346405228758 [2023-11-19 07:56:56,236 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2023-11-19 07:56:56,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2023-11-19 07:56:56,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:56:56,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2023-11-19 07:56:56,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:56,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:56,249 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:56,250 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 128 flow. Second operand 6 states and 771 transitions. [2023-11-19 07:56:56,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 324 flow [2023-11-19 07:56:56,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:56:56,382 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 133 flow [2023-11-19 07:56:56,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-11-19 07:56:56,385 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-11-19 07:56:56,386 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 133 flow [2023-11-19 07:56:56,387 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-19 07:56:56,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:56:56,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:56:56,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:56:56,388 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:56:56,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:56:56,390 INFO L85 PathProgramCache]: Analyzing trace with hash 979010700, now seen corresponding path program 1 times [2023-11-19 07:56:56,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:56:56,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134603235] [2023-11-19 07:56:56,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:56:56,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:56:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:56:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:56:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:56:57,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134603235] [2023-11-19 07:56:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134603235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:56:57,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:56:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:56:57,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402315165] [2023-11-19 07:56:57,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:56:57,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:56:57,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:56:57,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:56:57,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:56:57,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 306 [2023-11-19 07:56:57,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:56:57,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:56:57,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 306 [2023-11-19 07:56:57,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:00,332 INFO L124 PetriNetUnfolderBase]: 9805/13941 cut-off events. [2023-11-19 07:57:00,332 INFO L125 PetriNetUnfolderBase]: For 4098/4188 co-relation queries the response was YES. [2023-11-19 07:57:00,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31881 conditions, 13941 events. 9805/13941 cut-off events. For 4098/4188 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 78791 event pairs, 3917 based on Foata normal form. 310/13945 useless extension candidates. Maximal degree in co-relation 31875. Up to 12604 conditions per place. [2023-11-19 07:57:00,458 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 41 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2023-11-19 07:57:00,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 253 flow [2023-11-19 07:57:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:57:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:57:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-11-19 07:57:00,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4057734204793028 [2023-11-19 07:57:00,465 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-11-19 07:57:00,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-11-19 07:57:00,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:00,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-11-19 07:57:00,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:00,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:00,478 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:00,479 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 133 flow. Second operand 6 states and 745 transitions. [2023-11-19 07:57:00,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 253 flow [2023-11-19 07:57:00,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 241 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-19 07:57:00,488 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 117 flow [2023-11-19 07:57:00,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-11-19 07:57:00,491 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-11-19 07:57:00,492 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 117 flow [2023-11-19 07:57:00,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:00,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:00,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:00,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:57:00,494 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:57:00,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:00,494 INFO L85 PathProgramCache]: Analyzing trace with hash 284557909, now seen corresponding path program 1 times [2023-11-19 07:57:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:00,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479455318] [2023-11-19 07:57:00,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:00,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:00,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479455318] [2023-11-19 07:57:00,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479455318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:00,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:00,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:57:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224542666] [2023-11-19 07:57:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:00,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:57:00,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:00,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:57:00,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:57:00,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 306 [2023-11-19 07:57:00,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:00,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:00,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 306 [2023-11-19 07:57:00,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:02,468 INFO L124 PetriNetUnfolderBase]: 8315/12341 cut-off events. [2023-11-19 07:57:02,468 INFO L125 PetriNetUnfolderBase]: For 2120/2314 co-relation queries the response was YES. [2023-11-19 07:57:02,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27729 conditions, 12341 events. 8315/12341 cut-off events. For 2120/2314 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 76786 event pairs, 1547 based on Foata normal form. 905/12991 useless extension candidates. Maximal degree in co-relation 27723. Up to 5261 conditions per place. [2023-11-19 07:57:02,545 INFO L140 encePairwiseOnDemand]: 299/306 looper letters, 57 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2023-11-19 07:57:02,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 71 transitions, 346 flow [2023-11-19 07:57:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:57:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:57:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-11-19 07:57:02,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730392156862745 [2023-11-19 07:57:02,549 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-11-19 07:57:02,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-11-19 07:57:02,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:02,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-11-19 07:57:02,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:02,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:02,556 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:02,556 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 117 flow. Second operand 4 states and 579 transitions. [2023-11-19 07:57:02,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 71 transitions, 346 flow [2023-11-19 07:57:02,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 71 transitions, 334 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:57:02,560 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 156 flow [2023-11-19 07:57:02,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-11-19 07:57:02,561 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-11-19 07:57:02,562 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 156 flow [2023-11-19 07:57:02,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:02,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:02,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:02,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:57:02,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:57:02,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash -538320434, now seen corresponding path program 1 times [2023-11-19 07:57:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:02,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221115450] [2023-11-19 07:57:02,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:02,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:02,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-19 07:57:02,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:02,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221115450] [2023-11-19 07:57:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221115450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:02,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:57:02,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410055928] [2023-11-19 07:57:02,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:02,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:57:02,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:02,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:57:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:57:02,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 306 [2023-11-19 07:57:02,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 156 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-19 07:57:02,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:02,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 306 [2023-11-19 07:57:02,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:04,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][44], [P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 33#L808true, Black: 199#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 166#true, Black: 197#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 203#true, 119#L881true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 85#L768true, 103#P1EXITtrue, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 98#L847true, P1Thread1of1ForFork2InUse]) [2023-11-19 07:57:04,087 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-19 07:57:04,087 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:57:04,087 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:57:04,087 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:57:04,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][44], [P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 199#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 166#true, Black: 197#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 151#L815true, 203#true, 119#L881true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 85#L768true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 103#P1EXITtrue, 98#L847true, P1Thread1of1ForFork2InUse]) [2023-11-19 07:57:04,284 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:57:04,284 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:57:04,284 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:57:04,285 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:57:04,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][44], [P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, 33#L808true, P2Thread1of1ForFork1InUse, Black: 199#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 166#true, Black: 197#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 85#L768true, 98#L847true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 103#P1EXITtrue, 13#L889true, P1Thread1of1ForFork2InUse]) [2023-11-19 07:57:04,289 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:57:04,289 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:57:04,289 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:57:04,289 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:57:04,528 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][44], [P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 199#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 166#true, Black: 197#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 203#true, 119#L881true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 85#L768true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 103#P1EXITtrue, 98#L847true, P1Thread1of1ForFork2InUse, 23#P2EXITtrue]) [2023-11-19 07:57:04,529 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,529 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,529 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,529 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][44], [P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 199#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 166#true, Black: 197#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 151#L815true, 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 85#L768true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 98#L847true, 103#P1EXITtrue, 13#L889true, P1Thread1of1ForFork2InUse]) [2023-11-19 07:57:04,531 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,531 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,531 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,531 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([629] L889-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40|) (= (ite (= (ite (not (and (= v_~y~0_21 2) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EAX~0_14 0) (= v_~__unbuffered_p0_EAX~0_16 0) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_21} 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_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20|, 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_14, ~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_22, ~y~0=v_~y~0_21} 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][55], [P3Thread1of1ForFork3InUse, 72#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, P0Thread1of1ForFork0InUse, 33#L808true, P2Thread1of1ForFork1InUse, Black: 199#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 166#true, 134#L831true, Black: 197#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 85#L768true, 103#P1EXITtrue, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), P1Thread1of1ForFork2InUse]) [2023-11-19 07:57:04,536 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-11-19 07:57:04,536 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:57:04,536 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:57:04,536 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:57:04,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][44], [P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, 9#L775true, P2Thread1of1ForFork1InUse, 33#L808true, Black: 199#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 166#true, Black: 197#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 103#P1EXITtrue, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 13#L889true, 98#L847true, P1Thread1of1ForFork2InUse]) [2023-11-19 07:57:04,581 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,581 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,581 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,581 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:57:04,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([629] L889-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40|) (= (ite (= (ite (not (and (= v_~y~0_21 2) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EAX~0_14 0) (= v_~__unbuffered_p0_EAX~0_16 0) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_21} 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_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20|, 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_14, ~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_22, ~y~0=v_~y~0_21} 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][55], [P3Thread1of1ForFork3InUse, 72#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 9#L775true, P0Thread1of1ForFork0InUse, 33#L808true, P2Thread1of1ForFork1InUse, 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), Black: 199#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 166#true, 134#L831true, Black: 197#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 103#P1EXITtrue, P1Thread1of1ForFork2InUse]) [2023-11-19 07:57:04,681 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-11-19 07:57:04,681 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:57:04,681 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:57:04,681 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:57:04,719 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L831-->L847: Formula: (let ((.cse4 (= (mod v_~b$r_buff1_thd4~0_60 256) 0)) (.cse6 (= (mod v_~b$r_buff0_thd4~0_62 256) 0))) (let ((.cse8 (not .cse6)) (.cse7 (and .cse6 .cse4)) (.cse12 (= (mod v_~b$w_buff0_used~0_150 256) 0)) (.cse9 (and .cse6 (= (mod v_~b$w_buff1_used~0_133 256) 0)))) (let ((.cse10 (or .cse7 .cse12 .cse9)) (.cse11 (and (not .cse12) .cse8))) (let ((.cse2 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (ite .cse10 v_~b~0_93 (ite .cse11 v_~b$w_buff0~0_61 v_~b$w_buff1~0_64))) (.cse3 (= (mod v_~b$w_buff0_used~0_149 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_32 256) 0)))) (and (= v_~b$w_buff0~0_61 v_~b$w_buff0~0_60) (= (ite .cse0 v_~b$r_buff1_thd4~0_60 (ite (let ((.cse1 (= (mod v_~b$r_buff0_thd4~0_61 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4))) v_~b$r_buff1_thd4~0_60 0)) v_~b$r_buff1_thd4~0_59) (= v_~b~0_92 (ite .cse0 v_~b$mem_tmp~0_18 .cse5)) (= v_~b$flush_delayed~0_25 0) (= (ite .cse0 v_~b$r_buff0_thd4~0_62 (ite (or (and .cse6 .cse2) .cse7 .cse3) v_~b$r_buff0_thd4~0_62 (ite (and .cse8 (not .cse3)) 0 v_~b$r_buff0_thd4~0_62))) v_~b$r_buff0_thd4~0_61) (= .cse5 v_~__unbuffered_p3_EBX~0_10) (= v_~b$mem_tmp~0_18 v_~b~0_93) (= v_~b$w_buff1_used~0_132 (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse7 .cse3 .cse9) v_~b$w_buff1_used~0_133 0))) (= v_~b$w_buff1~0_64 v_~b$w_buff1~0_63) (= (ite .cse0 v_~b$w_buff0_used~0_150 (ite .cse10 v_~b$w_buff0_used~0_150 (ite .cse11 0 v_~b$w_buff0_used~0_150))) v_~b$w_buff0_used~0_149)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_150, ~b~0=v_~b~0_93, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_60, ~b$w_buff1~0=v_~b$w_buff1~0_64, ~b$w_buff0~0=v_~b$w_buff0~0_61, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_62} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_149, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_92, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_59, ~b$w_buff1~0=v_~b$w_buff1~0_63, ~b$w_buff0~0=v_~b$w_buff0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_61} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][44], [P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 199#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), Black: 197#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 166#true, 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 85#L768true, 13#L889true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 103#P1EXITtrue, 98#L847true, P1Thread1of1ForFork2InUse, 23#P2EXITtrue]) [2023-11-19 07:57:04,719 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 07:57:04,719 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:57:04,719 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:57:04,719 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 07:57:04,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([629] L889-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40|) (= (ite (= (ite (not (and (= v_~y~0_21 2) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EAX~0_14 0) (= v_~__unbuffered_p0_EAX~0_16 0) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_21} 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_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20|, 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_14, ~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_22, ~y~0=v_~y~0_21} 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][55], [P3Thread1of1ForFork3InUse, 72#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 199#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 166#true, 134#L831true, Black: 197#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 151#L815true, 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 85#L768true, 103#P1EXITtrue, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), P1Thread1of1ForFork2InUse]) [2023-11-19 07:57:04,720 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-11-19 07:57:04,720 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:57:04,720 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:57:04,720 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:57:04,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([629] L889-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (mod v_~main$tmp_guard1~0_16 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_40|) (= (ite (= (ite (not (and (= v_~y~0_21 2) (= v_~__unbuffered_p3_EAX~0_14 1) (= v_~__unbuffered_p2_EAX~0_14 0) (= v_~__unbuffered_p0_EAX~0_16 0) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_21} 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_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_20|, 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_14, ~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_22, ~y~0=v_~y~0_21} 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][55], [P3Thread1of1ForFork3InUse, 72#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, Black: 199#(and (<= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 192#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 166#true, 134#L831true, Black: 197#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 203#true, Black: 175#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 194#true, 85#L768true, Black: 184#(and (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1026~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1026~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1026~0#1.base| 0) |ULTIMATE.start_main_~#t1028~0#1.base| 0) |ULTIMATE.start_main_~#t1025~0#1.base| 0) |ULTIMATE.start_main_~#t1027~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1027~0#1.base| |ULTIMATE.start_main_~#t1025~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1028~0#1.base| |ULTIMATE.start_main_~#t1027~0#1.base|))), 103#P1EXITtrue, P1Thread1of1ForFork2InUse, 23#P2EXITtrue]) [2023-11-19 07:57:04,860 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-11-19 07:57:04,860 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-19 07:57:04,860 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-19 07:57:04,861 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-11-19 07:57:04,979 INFO L124 PetriNetUnfolderBase]: 9102/13581 cut-off events. [2023-11-19 07:57:04,980 INFO L125 PetriNetUnfolderBase]: For 6431/6780 co-relation queries the response was YES. [2023-11-19 07:57:05,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37853 conditions, 13581 events. 9102/13581 cut-off events. For 6431/6780 co-relation queries the response was YES. Maximal size of possible extension queue 587. Compared 83243 event pairs, 2606 based on Foata normal form. 32/13365 useless extension candidates. Maximal degree in co-relation 37845. Up to 12386 conditions per place. [2023-11-19 07:57:05,099 INFO L140 encePairwiseOnDemand]: 302/306 looper letters, 48 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-11-19 07:57:05,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 337 flow [2023-11-19 07:57:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:57:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:57:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2023-11-19 07:57:05,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48366013071895425 [2023-11-19 07:57:05,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2023-11-19 07:57:05,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2023-11-19 07:57:05,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:05,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2023-11-19 07:57:05,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:05,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:05,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:05,114 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 156 flow. Second operand 3 states and 444 transitions. [2023-11-19 07:57:05,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 337 flow [2023-11-19 07:57:05,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:57:05,122 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 189 flow [2023-11-19 07:57:05,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=154, 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=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-11-19 07:57:05,124 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-11-19 07:57:05,124 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 189 flow [2023-11-19 07:57:05,125 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-19 07:57:05,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:05,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:05,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:57:05,126 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:57:05,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash -720670887, now seen corresponding path program 1 times [2023-11-19 07:57:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:05,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707563463] [2023-11-19 07:57:05,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:05,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:05,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:05,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707563463] [2023-11-19 07:57:05,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707563463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:05,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:05,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:57:05,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494898747] [2023-11-19 07:57:05,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:05,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:57:05,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:05,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:57:05,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:57:05,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 306 [2023-11-19 07:57:05,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:05,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:05,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 306 [2023-11-19 07:57:05,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:09,127 INFO L124 PetriNetUnfolderBase]: 14565/20664 cut-off events. [2023-11-19 07:57:09,127 INFO L125 PetriNetUnfolderBase]: For 15536/15536 co-relation queries the response was YES. [2023-11-19 07:57:09,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60675 conditions, 20664 events. 14565/20664 cut-off events. For 15536/15536 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 119644 event pairs, 804 based on Foata normal form. 204/20868 useless extension candidates. Maximal degree in co-relation 60666. Up to 9179 conditions per place. [2023-11-19 07:57:09,283 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 85 selfloop transitions, 20 changer transitions 4/109 dead transitions. [2023-11-19 07:57:09,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 109 transitions, 684 flow [2023-11-19 07:57:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:57:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:57:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 707 transitions. [2023-11-19 07:57:09,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4620915032679739 [2023-11-19 07:57:09,297 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 707 transitions. [2023-11-19 07:57:09,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 707 transitions. [2023-11-19 07:57:09,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:09,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 707 transitions. [2023-11-19 07:57:09,303 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-19 07:57:09,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:09,308 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:09,308 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 189 flow. Second operand 5 states and 707 transitions. [2023-11-19 07:57:09,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 109 transitions, 684 flow [2023-11-19 07:57:09,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 109 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:57:09,323 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 323 flow [2023-11-19 07:57:09,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-11-19 07:57:09,326 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-11-19 07:57:09,326 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 323 flow [2023-11-19 07:57:09,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:09,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:09,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:09,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:57:09,327 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:57:09,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash -855453513, now seen corresponding path program 1 times [2023-11-19 07:57:09,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:09,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049722275] [2023-11-19 07:57:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:09,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:09,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:09,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049722275] [2023-11-19 07:57:09,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049722275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:09,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:09,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:57:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144755881] [2023-11-19 07:57:09,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:09,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:57:09,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:09,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:57:09,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:57:09,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 306 [2023-11-19 07:57:09,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:09,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:09,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 306 [2023-11-19 07:57:09,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:12,483 INFO L124 PetriNetUnfolderBase]: 14116/20262 cut-off events. [2023-11-19 07:57:12,483 INFO L125 PetriNetUnfolderBase]: For 28922/28922 co-relation queries the response was YES. [2023-11-19 07:57:12,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66768 conditions, 20262 events. 14116/20262 cut-off events. For 28922/28922 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 117726 event pairs, 4516 based on Foata normal form. 204/20466 useless extension candidates. Maximal degree in co-relation 66756. Up to 10490 conditions per place. [2023-11-19 07:57:12,628 INFO L140 encePairwiseOnDemand]: 300/306 looper letters, 74 selfloop transitions, 14 changer transitions 5/93 dead transitions. [2023-11-19 07:57:12,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 700 flow [2023-11-19 07:57:12,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:57:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:57:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2023-11-19 07:57:12,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4665032679738562 [2023-11-19 07:57:12,632 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2023-11-19 07:57:12,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2023-11-19 07:57:12,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:12,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2023-11-19 07:57:12,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:12,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:12,640 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:12,640 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 323 flow. Second operand 4 states and 571 transitions. [2023-11-19 07:57:12,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 700 flow [2023-11-19 07:57:12,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 93 transitions, 686 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-19 07:57:12,709 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 375 flow [2023-11-19 07:57:12,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=375, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2023-11-19 07:57:12,710 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-11-19 07:57:12,710 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 375 flow [2023-11-19 07:57:12,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:12,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:12,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:57:12,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:57:12,711 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:57:12,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1014220424, now seen corresponding path program 1 times [2023-11-19 07:57:12,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:12,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177948580] [2023-11-19 07:57:12,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:12,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:12,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177948580] [2023-11-19 07:57:12,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177948580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:12,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:57:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548659149] [2023-11-19 07:57:12,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:12,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:57:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:12,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:57:12,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:57:12,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 306 [2023-11-19 07:57:12,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 375 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:12,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:12,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 306 [2023-11-19 07:57:12,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:57:14,357 INFO L124 PetriNetUnfolderBase]: 6715/10624 cut-off events. [2023-11-19 07:57:14,357 INFO L125 PetriNetUnfolderBase]: For 10846/11584 co-relation queries the response was YES. [2023-11-19 07:57:14,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31439 conditions, 10624 events. 6715/10624 cut-off events. For 10846/11584 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 71002 event pairs, 775 based on Foata normal form. 1231/11669 useless extension candidates. Maximal degree in co-relation 31425. Up to 3882 conditions per place. [2023-11-19 07:57:14,419 INFO L140 encePairwiseOnDemand]: 299/306 looper letters, 90 selfloop transitions, 10 changer transitions 0/118 dead transitions. [2023-11-19 07:57:14,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 118 transitions, 899 flow [2023-11-19 07:57:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:57:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:57:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2023-11-19 07:57:14,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4745098039215686 [2023-11-19 07:57:14,423 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2023-11-19 07:57:14,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2023-11-19 07:57:14,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:57:14,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2023-11-19 07:57:14,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:14,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:14,430 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:14,430 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 375 flow. Second operand 5 states and 726 transitions. [2023-11-19 07:57:14,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 118 transitions, 899 flow [2023-11-19 07:57:14,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 118 transitions, 858 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-11-19 07:57:14,443 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 424 flow [2023-11-19 07:57:14,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=424, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2023-11-19 07:57:14,444 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-11-19 07:57:14,444 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 424 flow [2023-11-19 07:57:14,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:14,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:57:14,445 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-19 07:57:14,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:57:14,445 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:57:14,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:57:14,446 INFO L85 PathProgramCache]: Analyzing trace with hash -90487707, now seen corresponding path program 1 times [2023-11-19 07:57:14,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:57:14,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470223269] [2023-11-19 07:57:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:57:14,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:57:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:57:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:57:14,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:57:14,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470223269] [2023-11-19 07:57:14,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470223269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:57:14,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:57:14,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:57:14,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126486203] [2023-11-19 07:57:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:57:14,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:57:14,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:57:14,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:57:14,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:57:14,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 306 [2023-11-19 07:57:14,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 424 flow. Second operand has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:57:14,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:57:14,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 306 [2023-11-19 07:57:14,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand