./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/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_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/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_911c26a0-4764-411e-9186-0c717500eebc/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 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:57:57,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:57:57,249 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:57:57,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:57:57,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:57:57,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:57:57,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:57:57,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:57:57,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:57:57,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:57:57,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:57:57,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:57:57,320 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:57:57,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:57:57,323 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:57:57,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:57:57,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:57:57,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:57:57,325 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:57:57,325 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:57:57,326 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:57:57,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:57:57,328 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:57:57,328 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:57:57,329 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:57:57,329 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:57:57,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:57:57,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:57:57,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:57:57,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:57:57,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:57:57,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:57:57,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:57:57,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:57:57,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:57:57,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:57:57,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:57:57,355 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:57:57,355 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_911c26a0-4764-411e-9186-0c717500eebc/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_911c26a0-4764-411e-9186-0c717500eebc/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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2023-11-19 07:57:57,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:57:57,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:57:57,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:57:57,673 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:57:57,674 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:57:57,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2023-11-19 07:58:00,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:58:01,033 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:58:01,033 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2023-11-19 07:58:01,053 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/data/795bab37d/50d9aa85a64746bc9dbc2cd14adcba99/FLAG17d12b79c [2023-11-19 07:58:01,067 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/data/795bab37d/50d9aa85a64746bc9dbc2cd14adcba99 [2023-11-19 07:58:01,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:58:01,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:58:01,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:01,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:58:01,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:58:01,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:01" (1/1) ... [2023-11-19 07:58:01,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8de756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01, skipping insertion in model container [2023-11-19 07:58:01,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:01" (1/1) ... [2023-11-19 07:58:01,160 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:58:01,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:01,643 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:58:01,749 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:01,787 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:58:01,787 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:58:01,796 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:58:01,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01 WrapperNode [2023-11-19 07:58:01,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:01,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:01,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:58:01,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:58:01,806 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:58:01" (1/1) ... [2023-11-19 07:58:01,852 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:58:01" (1/1) ... [2023-11-19 07:58:01,898 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-19 07:58:01,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:01,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:58:01,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:58:01,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:58:01,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01" (1/1) ... [2023-11-19 07:58:01,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01" (1/1) ... [2023-11-19 07:58:01,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01" (1/1) ... [2023-11-19 07:58:01,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01" (1/1) ... [2023-11-19 07:58:01,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01" (1/1) ... [2023-11-19 07:58:01,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01" (1/1) ... [2023-11-19 07:58:01,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01" (1/1) ... [2023-11-19 07:58:01,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01" (1/1) ... [2023-11-19 07:58:01,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:58:01,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:58:01,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:58:01,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:58:01,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01" (1/1) ... [2023-11-19 07:58:01,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:58:01,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:58:02,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/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:58:02,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/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:58:02,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:58:02,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:58:02,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:58:02,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:58:02,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:58:02,061 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:58:02,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:58:02,062 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:58:02,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:58:02,062 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:58:02,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:58:02,063 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:58:02,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:58:02,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:58:02,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:58:02,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:58:02,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:58:02,067 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:58:02,237 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:58:02,239 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:58:02,731 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:58:02,913 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:58:02,914 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:58:02,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:02 BoogieIcfgContainer [2023-11-19 07:58:02,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:58:02,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:58:02,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:58:02,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:58:02,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:58:01" (1/3) ... [2023-11-19 07:58:02,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ff3ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:02, skipping insertion in model container [2023-11-19 07:58:02,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:01" (2/3) ... [2023-11-19 07:58:02,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ff3ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:58:02, skipping insertion in model container [2023-11-19 07:58:02,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:02" (3/3) ... [2023-11-19 07:58:02,929 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2023-11-19 07:58:02,946 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:58:02,946 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 07:58:02,947 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:58:03,027 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:58:03,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 322 flow [2023-11-19 07:58:03,189 INFO L124 PetriNetUnfolderBase]: 5/149 cut-off events. [2023-11-19 07:58:03,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:58:03,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 5/149 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/133 useless extension candidates. Maximal degree in co-relation 108. Up to 3 conditions per place. [2023-11-19 07:58:03,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 153 transitions, 322 flow [2023-11-19 07:58:03,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 149 transitions, 310 flow [2023-11-19 07:58:03,219 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:58:03,229 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 149 transitions, 310 flow [2023-11-19 07:58:03,232 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 149 transitions, 310 flow [2023-11-19 07:58:03,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 149 transitions, 310 flow [2023-11-19 07:58:03,269 INFO L124 PetriNetUnfolderBase]: 5/149 cut-off events. [2023-11-19 07:58:03,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:58:03,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 5/149 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/133 useless extension candidates. Maximal degree in co-relation 108. Up to 3 conditions per place. [2023-11-19 07:58:03,275 INFO L119 LiptonReduction]: Number of co-enabled transitions 4378 [2023-11-19 07:58:08,961 INFO L134 LiptonReduction]: Checked pairs total: 9924 [2023-11-19 07:58:08,962 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-11-19 07:58:09,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:58:09,055 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;@7697815, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:58:09,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 07:58:09,057 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:58:09,057 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:58:09,057 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:58:09,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:09,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:58:09,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:09,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash 655, now seen corresponding path program 1 times [2023-11-19 07:58:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:09,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539258010] [2023-11-19 07:58:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:09,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:09,216 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:58:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:09,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539258010] [2023-11-19 07:58:09,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539258010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:09,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:09,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:58:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282371566] [2023-11-19 07:58:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:09,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:58:09,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:09,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:58:09,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:58:09,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 303 [2023-11-19 07:58:09,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:09,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:09,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 303 [2023-11-19 07:58:09,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:10,826 INFO L124 PetriNetUnfolderBase]: 5973/8500 cut-off events. [2023-11-19 07:58:10,826 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-19 07:58:10,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16818 conditions, 8500 events. 5973/8500 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 46574 event pairs, 5973 based on Foata normal form. 0/7575 useless extension candidates. Maximal degree in co-relation 16806. Up to 8103 conditions per place. [2023-11-19 07:58:10,912 INFO L140 encePairwiseOnDemand]: 294/303 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-19 07:58:10,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-11-19 07:58:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:58:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:58:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2023-11-19 07:58:10,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066006600660066 [2023-11-19 07:58:10,935 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2023-11-19 07:58:10,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2023-11-19 07:58:10,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:10,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2023-11-19 07:58:10,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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:58:10,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states 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:58:10,958 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states 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:58:10,960 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 307 transitions. [2023-11-19 07:58:10,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-11-19 07:58:10,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:58:10,970 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-19 07:58:10,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, 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:58:11,022 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-19 07:58:11,027 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-19 07:58:11,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:11,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:11,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 07:58:11,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:58:11,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:11,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash 620581847, now seen corresponding path program 1 times [2023-11-19 07:58:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:11,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546249411] [2023-11-19 07:58:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:11,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:11,459 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:58:11,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546249411] [2023-11-19 07:58:11,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546249411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:11,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:11,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:58:11,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372916991] [2023-11-19 07:58:11,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:11,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:11,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:11,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:11,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 303 [2023-11-19 07:58:11,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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:58:11,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:11,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 303 [2023-11-19 07:58:11,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:12,740 INFO L124 PetriNetUnfolderBase]: 4695/6904 cut-off events. [2023-11-19 07:58:12,740 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:58:12,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13477 conditions, 6904 events. 4695/6904 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 40439 event pairs, 861 based on Foata normal form. 0/6596 useless extension candidates. Maximal degree in co-relation 13474. Up to 5107 conditions per place. [2023-11-19 07:58:12,798 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 39 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-11-19 07:58:12,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 194 flow [2023-11-19 07:58:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:58:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-11-19 07:58:12,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49394939493949397 [2023-11-19 07:58:12,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-11-19 07:58:12,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-11-19 07:58:12,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:12,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-11-19 07:58:12,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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:58:12,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states 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:58:12,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states 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:58:12,818 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 449 transitions. [2023-11-19 07:58:12,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 194 flow [2023-11-19 07:58:12,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:58:12,821 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-19 07:58:12,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, 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:58:12,824 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-19 07:58:12,825 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-19 07:58:12,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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:58:12,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:12,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:12,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:58:12,833 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:12,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:12,837 INFO L85 PathProgramCache]: Analyzing trace with hash -737229520, now seen corresponding path program 1 times [2023-11-19 07:58:12,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:12,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907361428] [2023-11-19 07:58:12,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:12,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:13,139 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:58:13,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:13,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907361428] [2023-11-19 07:58:13,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907361428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:13,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:13,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:58:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949889786] [2023-11-19 07:58:13,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:13,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:58:13,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:13,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:58:13,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:58:13,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 303 [2023-11-19 07:58:13,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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:58:13,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:13,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 303 [2023-11-19 07:58:13,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:14,360 INFO L124 PetriNetUnfolderBase]: 4871/7318 cut-off events. [2023-11-19 07:58:14,360 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-19 07:58:14,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14605 conditions, 7318 events. 4871/7318 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 41481 event pairs, 1127 based on Foata normal form. 0/6945 useless extension candidates. Maximal degree in co-relation 14601. Up to 6001 conditions per place. [2023-11-19 07:58:14,422 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 36 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-11-19 07:58:14,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 180 flow [2023-11-19 07:58:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:58:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:58:14,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-11-19 07:58:14,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4829482948294829 [2023-11-19 07:58:14,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-11-19 07:58:14,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-11-19 07:58:14,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:14,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-11-19 07:58:14,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:58:14,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states 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:58:14,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states 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:58:14,433 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 439 transitions. [2023-11-19 07:58:14,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 180 flow [2023-11-19 07:58:14,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:58:14,436 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 85 flow [2023-11-19 07:58:14,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, 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=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-11-19 07:58:14,438 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-19 07:58:14,438 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 85 flow [2023-11-19 07:58:14,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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:58:14,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:14,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:14,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:58:14,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:14,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1379281354, now seen corresponding path program 1 times [2023-11-19 07:58:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456435305] [2023-11-19 07:58:14,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:14,696 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:58:14,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:14,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456435305] [2023-11-19 07:58:14,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456435305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:14,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:14,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:58:14,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356042743] [2023-11-19 07:58:14,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:14,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:58:14,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:14,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:58:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:58:14,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 303 [2023-11-19 07:58:14,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:58:14,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:14,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 303 [2023-11-19 07:58:14,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:17,096 INFO L124 PetriNetUnfolderBase]: 12267/17276 cut-off events. [2023-11-19 07:58:17,096 INFO L125 PetriNetUnfolderBase]: For 1508/1508 co-relation queries the response was YES. [2023-11-19 07:58:17,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35968 conditions, 17276 events. 12267/17276 cut-off events. For 1508/1508 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 93584 event pairs, 2839 based on Foata normal form. 400/17676 useless extension candidates. Maximal degree in co-relation 35963. Up to 8353 conditions per place. [2023-11-19 07:58:17,343 INFO L140 encePairwiseOnDemand]: 295/303 looper letters, 54 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-11-19 07:58:17,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 62 transitions, 273 flow [2023-11-19 07:58:17,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:58:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:58:17,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2023-11-19 07:58:17,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4661716171617162 [2023-11-19 07:58:17,347 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2023-11-19 07:58:17,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2023-11-19 07:58:17,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:17,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2023-11-19 07:58:17,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states 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:58:17,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states 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:58:17,355 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states 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:58:17,355 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 85 flow. Second operand 4 states and 565 transitions. [2023-11-19 07:58:17,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 62 transitions, 273 flow [2023-11-19 07:58:17,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 62 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:58:17,359 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 136 flow [2023-11-19 07:58:17,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-11-19 07:58:17,362 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-11-19 07:58:17,362 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 136 flow [2023-11-19 07:58:17,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:58:17,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:17,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:17,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:58:17,364 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:17,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:17,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1379277936, now seen corresponding path program 1 times [2023-11-19 07:58:17,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:17,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341337266] [2023-11-19 07:58:17,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:17,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:18,000 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:58:18,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:18,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341337266] [2023-11-19 07:58:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341337266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:18,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:18,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:58:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506841050] [2023-11-19 07:58:18,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:18,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:58:18,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:18,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:58:18,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:58:18,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 303 [2023-11-19 07:58:18,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 136 flow. Second operand has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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:58:18,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:18,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 303 [2023-11-19 07:58:18,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:19,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([603] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44|) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_22 2) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~__unbuffered_p1_EAX~0_20 0) (= v_~__unbuffered_p0_EAX~0_30 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_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_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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][47], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 154#L815true, 164#true, 84#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 173#(= ~z~0 0), 38#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 78#L772true, 22#L835true, P1Thread1of1ForFork0InUse, 176#true, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:19,672 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-19 07:58:19,672 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:58:19,672 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:58:19,672 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:58:19,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([603] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44|) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_22 2) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~__unbuffered_p1_EAX~0_20 0) (= v_~__unbuffered_p0_EAX~0_30 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_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_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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][47], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 154#L815true, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 164#true, 84#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 173#(= ~z~0 0), 38#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#L835true, 93#P0EXITtrue, 176#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:19,817 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-19 07:58:19,817 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:58:19,817 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:58:19,817 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:58:19,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L880-->main_returnLabel#1: Formula: (and (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_34 0) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~z~0_32 2))) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard1~0_22 256) 0)) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_#valid_206| (store (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t685~0#1.base_72| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t688~0#1.base_60| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_56|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_56|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ULTIMATE.start_main_~#t688~0#1.base=|v_ULTIMATE.start_main_~#t688~0#1.base_60|, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_72|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_52|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_56|, ULTIMATE.start_main_~#t687~0#1.offset=|v_ULTIMATE.start_main_~#t687~0#1.offset_46|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_42|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t688~0#1.offset=|v_ULTIMATE.start_main_~#t688~0#1.offset_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t687~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t687~0#1.offset, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t688~0#1.base, #valid, ULTIMATE.start_main_~#t685~0#1.base, ULTIMATE.start_main_~#t688~0#1.offset][46], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 154#L815true, 164#true, 80#main_returnLabel#1true, 190#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 173#(= ~z~0 0), 38#L795true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, 78#L772true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#L835true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:19,845 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-11-19 07:58:19,845 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-19 07:58:19,845 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-19 07:58:19,845 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-19 07:58:19,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([603] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44|) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_22 2) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~__unbuffered_p1_EAX~0_20 0) (= v_~__unbuffered_p0_EAX~0_30 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_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_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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][47], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 164#true, 84#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 173#(= ~z~0 0), 38#L795true, 124#L822true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 78#L772true, 22#L835true, 176#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:19,947 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-19 07:58:19,948 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:58:19,948 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:58:19,948 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:58:20,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L880-->main_returnLabel#1: Formula: (and (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_34 0) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~z~0_32 2))) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard1~0_22 256) 0)) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_#valid_206| (store (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t685~0#1.base_72| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t688~0#1.base_60| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_56|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_56|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ULTIMATE.start_main_~#t688~0#1.base=|v_ULTIMATE.start_main_~#t688~0#1.base_60|, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_72|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_52|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_56|, ULTIMATE.start_main_~#t687~0#1.offset=|v_ULTIMATE.start_main_~#t687~0#1.offset_46|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_42|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t688~0#1.offset=|v_ULTIMATE.start_main_~#t688~0#1.offset_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t687~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t687~0#1.offset, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t688~0#1.base, #valid, ULTIMATE.start_main_~#t685~0#1.base, ULTIMATE.start_main_~#t688~0#1.offset][46], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 154#L815true, 164#true, 80#main_returnLabel#1true, 190#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 173#(= ~z~0 0), 38#L795true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#L835true, 93#P0EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:20,054 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-19 07:58:20,054 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 07:58:20,054 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 07:58:20,054 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 07:58:20,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([603] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44|) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_22 2) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~__unbuffered_p1_EAX~0_20 0) (= v_~__unbuffered_p0_EAX~0_30 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_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_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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][47], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 164#true, 84#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 173#(= ~z~0 0), 38#L795true, 124#L822true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#L835true, 93#P0EXITtrue, P1Thread1of1ForFork0InUse, 176#true, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:20,067 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:58:20,067 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:58:20,068 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:58:20,068 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:58:20,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L880-->main_returnLabel#1: Formula: (and (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_34 0) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~z~0_32 2))) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard1~0_22 256) 0)) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_#valid_206| (store (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t685~0#1.base_72| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t688~0#1.base_60| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_56|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_56|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ULTIMATE.start_main_~#t688~0#1.base=|v_ULTIMATE.start_main_~#t688~0#1.base_60|, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_72|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_52|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_56|, ULTIMATE.start_main_~#t687~0#1.offset=|v_ULTIMATE.start_main_~#t687~0#1.offset_46|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_42|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t688~0#1.offset=|v_ULTIMATE.start_main_~#t688~0#1.offset_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t687~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t687~0#1.offset, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t688~0#1.base, #valid, ULTIMATE.start_main_~#t685~0#1.base, ULTIMATE.start_main_~#t688~0#1.offset][46], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 164#true, 80#main_returnLabel#1true, 190#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 173#(= ~z~0 0), 38#L795true, 124#L822true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, 78#L772true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#L835true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:20,096 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-19 07:58:20,096 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 07:58:20,096 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 07:58:20,097 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-19 07:58:20,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([603] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44|) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_22 2) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~__unbuffered_p1_EAX~0_20 0) (= v_~__unbuffered_p0_EAX~0_30 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_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_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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][47], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 164#true, 84#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 173#(= ~z~0 0), 38#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 78#L772true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#P2EXITtrue, 22#L835true, 176#true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:20,193 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 07:58:20,193 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:58:20,193 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:58:20,193 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 07:58:20,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L880-->main_returnLabel#1: Formula: (and (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_34 0) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~z~0_32 2))) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard1~0_22 256) 0)) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_#valid_206| (store (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t685~0#1.base_72| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t688~0#1.base_60| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_56|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_56|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ULTIMATE.start_main_~#t688~0#1.base=|v_ULTIMATE.start_main_~#t688~0#1.base_60|, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_72|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_52|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_56|, ULTIMATE.start_main_~#t687~0#1.offset=|v_ULTIMATE.start_main_~#t687~0#1.offset_46|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_42|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t688~0#1.offset=|v_ULTIMATE.start_main_~#t688~0#1.offset_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t687~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t687~0#1.offset, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t688~0#1.base, #valid, ULTIMATE.start_main_~#t685~0#1.base, ULTIMATE.start_main_~#t688~0#1.offset][46], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 164#true, 80#main_returnLabel#1true, 190#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 173#(= ~z~0 0), 38#L795true, 124#L822true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#L835true, 93#P0EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:20,272 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-11-19 07:58:20,272 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:58:20,273 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:58:20,273 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:58:20,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([603] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44|) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_44| 0) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_20) (= v_~z~0_22 2) (= 0 v_~__unbuffered_p3_EBX~0_20) (= v_~__unbuffered_p1_EAX~0_20 0) (= v_~__unbuffered_p0_EAX~0_30 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_24|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_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_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_20} 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][47], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 164#true, 84#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 173#(= ~z~0 0), 38#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#P2EXITtrue, 22#L835true, 93#P0EXITtrue, P1Thread1of1ForFork0InUse, 176#true, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:20,285 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 07:58:20,286 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:58:20,286 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:58:20,286 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 07:58:20,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L880-->main_returnLabel#1: Formula: (and (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_34 0) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~z~0_32 2))) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard1~0_22 256) 0)) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_#valid_206| (store (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t685~0#1.base_72| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t688~0#1.base_60| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_56|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_56|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ULTIMATE.start_main_~#t688~0#1.base=|v_ULTIMATE.start_main_~#t688~0#1.base_60|, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_72|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_52|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_56|, ULTIMATE.start_main_~#t687~0#1.offset=|v_ULTIMATE.start_main_~#t687~0#1.offset_46|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_42|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t688~0#1.offset=|v_ULTIMATE.start_main_~#t688~0#1.offset_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t687~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t687~0#1.offset, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t688~0#1.base, #valid, ULTIMATE.start_main_~#t685~0#1.base, ULTIMATE.start_main_~#t688~0#1.offset][46], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 164#true, 80#main_returnLabel#1true, 190#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), Black: 173#(= ~z~0 0), 38#L795true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, 78#L772true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#P2EXITtrue, 22#L835true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:20,451 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-11-19 07:58:20,451 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:58:20,451 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:58:20,452 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-19 07:58:20,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L880-->main_returnLabel#1: Formula: (and (= v_~main$tmp_guard1~0_22 (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_34 0) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EAX~0_24 0) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~z~0_32 2))) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard1~0_22 256) 0)) (= |v_ULTIMATE.start_main_#res#1_32| 0) (= |v_#valid_206| (store (store (store (store |v_#valid_208| |v_ULTIMATE.start_main_~#t685~0#1.base_72| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_56| 0) |v_ULTIMATE.start_main_~#t688~0#1.base_60| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_56|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_56|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ULTIMATE.start_main_~#t688~0#1.base=|v_ULTIMATE.start_main_~#t688~0#1.base_60|, #valid=|v_#valid_208|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_72|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_52|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_56|, ULTIMATE.start_main_~#t687~0#1.offset=|v_ULTIMATE.start_main_~#t687~0#1.offset_46|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_42|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, #valid=|v_#valid_206|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ~z~0=v_~z~0_32, ULTIMATE.start_main_~#t688~0#1.offset=|v_ULTIMATE.start_main_~#t688~0#1.offset_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t687~0#1.base, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t687~0#1.offset, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t688~0#1.base, #valid, ULTIMATE.start_main_~#t685~0#1.base, ULTIMATE.start_main_~#t688~0#1.offset][46], [P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 164#true, 190#(= |ULTIMATE.start_main_old_#valid#1| |#valid|), 80#main_returnLabel#1true, Black: 173#(= ~z~0 0), 38#L795true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#P2EXITtrue, 22#L835true, 93#P0EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse]) [2023-11-19 07:58:20,552 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-11-19 07:58:20,552 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:58:20,552 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:58:20,552 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-11-19 07:58:20,713 INFO L124 PetriNetUnfolderBase]: 9155/12920 cut-off events. [2023-11-19 07:58:20,713 INFO L125 PetriNetUnfolderBase]: For 6983/7476 co-relation queries the response was YES. [2023-11-19 07:58:20,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31848 conditions, 12920 events. 9155/12920 cut-off events. For 6983/7476 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 74398 event pairs, 2343 based on Foata normal form. 740/12977 useless extension candidates. Maximal degree in co-relation 31841. Up to 8399 conditions per place. [2023-11-19 07:58:20,792 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 39 selfloop transitions, 4 changer transitions 16/67 dead transitions. [2023-11-19 07:58:20,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 332 flow [2023-11-19 07:58:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:58:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:58:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 860 transitions. [2023-11-19 07:58:20,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40546911834040544 [2023-11-19 07:58:20,797 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 860 transitions. [2023-11-19 07:58:20,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 860 transitions. [2023-11-19 07:58:20,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:20,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 860 transitions. [2023-11-19 07:58:20,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states 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:58:20,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states 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:58:20,809 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states 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:58:20,809 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 136 flow. Second operand 7 states and 860 transitions. [2023-11-19 07:58:20,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 332 flow [2023-11-19 07:58:20,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:58:20,823 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 130 flow [2023-11-19 07:58:20,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-11-19 07:58:20,825 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-11-19 07:58:20,825 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 130 flow [2023-11-19 07:58:20,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.71428571428571) internal successors, (817), 7 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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:58:20,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:20,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:20,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:58:20,827 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:20,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:20,827 INFO L85 PathProgramCache]: Analyzing trace with hash 113039570, now seen corresponding path program 1 times [2023-11-19 07:58:20,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:20,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762887152] [2023-11-19 07:58:20,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:20,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:21,101 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:58:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762887152] [2023-11-19 07:58:21,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762887152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:21,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:21,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:58:21,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435642595] [2023-11-19 07:58:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:21,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:58:21,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:21,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:58:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:58:21,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 303 [2023-11-19 07:58:21,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:58:21,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:21,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 303 [2023-11-19 07:58:21,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:22,100 INFO L124 PetriNetUnfolderBase]: 5564/8249 cut-off events. [2023-11-19 07:58:22,100 INFO L125 PetriNetUnfolderBase]: For 2770/2879 co-relation queries the response was YES. [2023-11-19 07:58:22,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19109 conditions, 8249 events. 5564/8249 cut-off events. For 2770/2879 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 48862 event pairs, 1156 based on Foata normal form. 628/8628 useless extension candidates. Maximal degree in co-relation 19101. Up to 5282 conditions per place. [2023-11-19 07:58:22,150 INFO L140 encePairwiseOnDemand]: 296/303 looper letters, 62 selfloop transitions, 10 changer transitions 2/82 dead transitions. [2023-11-19 07:58:22,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 418 flow [2023-11-19 07:58:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:58:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:58:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2023-11-19 07:58:22,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46072607260726073 [2023-11-19 07:58:22,155 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2023-11-19 07:58:22,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2023-11-19 07:58:22,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:22,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2023-11-19 07:58:22,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states 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:58:22,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:58:22,162 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:58:22,162 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 130 flow. Second operand 5 states and 698 transitions. [2023-11-19 07:58:22,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 418 flow [2023-11-19 07:58:22,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 406 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:58:22,167 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 198 flow [2023-11-19 07:58:22,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-19 07:58:22,168 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-11-19 07:58:22,168 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 198 flow [2023-11-19 07:58:22,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:58:22,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:22,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:22,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:58:22,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:22,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1576945782, now seen corresponding path program 1 times [2023-11-19 07:58:22,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:22,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228619463] [2023-11-19 07:58:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:22,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:22,459 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:58:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:22,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228619463] [2023-11-19 07:58:22,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228619463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:22,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:22,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:58:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977917409] [2023-11-19 07:58:22,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:22,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:58:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:22,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:58:22,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:58:22,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 303 [2023-11-19 07:58:22,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states 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:58:22,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:22,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 303 [2023-11-19 07:58:22,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:23,562 INFO L124 PetriNetUnfolderBase]: 4371/6712 cut-off events. [2023-11-19 07:58:23,563 INFO L125 PetriNetUnfolderBase]: For 4293/4329 co-relation queries the response was YES. [2023-11-19 07:58:23,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20045 conditions, 6712 events. 4371/6712 cut-off events. For 4293/4329 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 40671 event pairs, 568 based on Foata normal form. 412/6951 useless extension candidates. Maximal degree in co-relation 20034. Up to 2205 conditions per place. [2023-11-19 07:58:23,602 INFO L140 encePairwiseOnDemand]: 296/303 looper letters, 87 selfloop transitions, 19 changer transitions 1/115 dead transitions. [2023-11-19 07:58:23,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 115 transitions, 670 flow [2023-11-19 07:58:23,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:58:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:58:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 979 transitions. [2023-11-19 07:58:23,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46157472890146156 [2023-11-19 07:58:23,608 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 979 transitions. [2023-11-19 07:58:23,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 979 transitions. [2023-11-19 07:58:23,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:23,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 979 transitions. [2023-11-19 07:58:23,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.85714285714286) internal successors, (979), 7 states have internal predecessors, (979), 0 states have call successors, (0), 0 states 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:58:23,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states 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:58:23,617 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states 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:58:23,617 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 198 flow. Second operand 7 states and 979 transitions. [2023-11-19 07:58:23,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 115 transitions, 670 flow [2023-11-19 07:58:23,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 115 transitions, 665 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:58:23,651 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 327 flow [2023-11-19 07:58:23,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=327, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-11-19 07:58:23,652 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-11-19 07:58:23,652 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 327 flow [2023-11-19 07:58:23,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states 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:58:23,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:23,653 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:58:23,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:58:23,654 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:23,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:23,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1675056230, now seen corresponding path program 1 times [2023-11-19 07:58:23,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:23,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12196503] [2023-11-19 07:58:23,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:23,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:23,905 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:58:23,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:23,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12196503] [2023-11-19 07:58:23,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12196503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:23,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:23,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:58:23,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903875004] [2023-11-19 07:58:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:23,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:58:23,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:23,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:58:23,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:58:23,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 303 [2023-11-19 07:58:23,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:58:23,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:23,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 303 [2023-11-19 07:58:23,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:25,490 INFO L124 PetriNetUnfolderBase]: 8910/13038 cut-off events. [2023-11-19 07:58:25,490 INFO L125 PetriNetUnfolderBase]: For 29421/29421 co-relation queries the response was YES. [2023-11-19 07:58:25,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47936 conditions, 13038 events. 8910/13038 cut-off events. For 29421/29421 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 75449 event pairs, 898 based on Foata normal form. 65/13103 useless extension candidates. Maximal degree in co-relation 47922. Up to 6108 conditions per place. [2023-11-19 07:58:25,566 INFO L140 encePairwiseOnDemand]: 294/303 looper letters, 109 selfloop transitions, 23 changer transitions 36/168 dead transitions. [2023-11-19 07:58:25,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 168 transitions, 1405 flow [2023-11-19 07:58:25,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:58:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:58:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions. [2023-11-19 07:58:25,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47062706270627064 [2023-11-19 07:58:25,572 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 713 transitions. [2023-11-19 07:58:25,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions. [2023-11-19 07:58:25,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:25,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions. [2023-11-19 07:58:25,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 0 states have call successors, (0), 0 states 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:58:25,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:58:25,582 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states 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:58:25,582 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 327 flow. Second operand 5 states and 713 transitions. [2023-11-19 07:58:25,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 168 transitions, 1405 flow [2023-11-19 07:58:26,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 168 transitions, 1233 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-11-19 07:58:26,367 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 417 flow [2023-11-19 07:58:26,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=417, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2023-11-19 07:58:26,368 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2023-11-19 07:58:26,368 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 417 flow [2023-11-19 07:58:26,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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:58:26,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:26,369 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:58:26,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:58:26,369 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:26,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash 966838820, now seen corresponding path program 2 times [2023-11-19 07:58:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:26,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163343770] [2023-11-19 07:58:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:26,664 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:58:26,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:26,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163343770] [2023-11-19 07:58:26,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163343770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:26,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:26,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:58:26,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393629295] [2023-11-19 07:58:26,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:26,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:58:26,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:26,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:58:26,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:58:26,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 303 [2023-11-19 07:58:26,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 417 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states 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:58:26,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:26,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 303 [2023-11-19 07:58:26,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:27,826 INFO L124 PetriNetUnfolderBase]: 5346/8115 cut-off events. [2023-11-19 07:58:27,826 INFO L125 PetriNetUnfolderBase]: For 19604/19604 co-relation queries the response was YES. [2023-11-19 07:58:27,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31945 conditions, 8115 events. 5346/8115 cut-off events. For 19604/19604 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 45017 event pairs, 671 based on Foata normal form. 63/8178 useless extension candidates. Maximal degree in co-relation 31928. Up to 2964 conditions per place. [2023-11-19 07:58:27,875 INFO L140 encePairwiseOnDemand]: 294/303 looper letters, 119 selfloop transitions, 24 changer transitions 15/158 dead transitions. [2023-11-19 07:58:27,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 158 transitions, 1281 flow [2023-11-19 07:58:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:58:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:58:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 851 transitions. [2023-11-19 07:58:27,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680968096809681 [2023-11-19 07:58:27,880 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 851 transitions. [2023-11-19 07:58:27,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 851 transitions. [2023-11-19 07:58:27,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:27,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 851 transitions. [2023-11-19 07:58:27,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states 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:58:27,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states 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:58:27,888 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states 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:58:27,888 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 417 flow. Second operand 6 states and 851 transitions. [2023-11-19 07:58:27,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 158 transitions, 1281 flow [2023-11-19 07:58:27,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 158 transitions, 1215 flow, removed 33 selfloop flow, removed 3 redundant places. [2023-11-19 07:58:27,982 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 487 flow [2023-11-19 07:58:27,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2023-11-19 07:58:27,983 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2023-11-19 07:58:27,984 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 487 flow [2023-11-19 07:58:27,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states 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:58:27,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:27,984 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:58:27,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:58:27,985 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:27,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1078159038, now seen corresponding path program 3 times [2023-11-19 07:58:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844398972] [2023-11-19 07:58:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:58:28,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:28,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844398972] [2023-11-19 07:58:28,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844398972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:28,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:28,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:58:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919273298] [2023-11-19 07:58:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:28,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:58:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:28,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:58:28,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:58:28,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 303 [2023-11-19 07:58:28,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 487 flow. Second operand has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states 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:58:28,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:28,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 303 [2023-11-19 07:58:28,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:29,336 INFO L124 PetriNetUnfolderBase]: 3437/5556 cut-off events. [2023-11-19 07:58:29,336 INFO L125 PetriNetUnfolderBase]: For 10433/10574 co-relation queries the response was YES. [2023-11-19 07:58:29,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19826 conditions, 5556 events. 3437/5556 cut-off events. For 10433/10574 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 33899 event pairs, 549 based on Foata normal form. 380/5835 useless extension candidates. Maximal degree in co-relation 19809. Up to 1760 conditions per place. [2023-11-19 07:58:29,359 INFO L140 encePairwiseOnDemand]: 296/303 looper letters, 96 selfloop transitions, 18 changer transitions 20/155 dead transitions. [2023-11-19 07:58:29,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 155 transitions, 1358 flow [2023-11-19 07:58:29,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:58:29,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:58:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 980 transitions. [2023-11-19 07:58:29,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46204620462046203 [2023-11-19 07:58:29,365 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 980 transitions. [2023-11-19 07:58:29,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 980 transitions. [2023-11-19 07:58:29,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:29,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 980 transitions. [2023-11-19 07:58:29,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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:58:29,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states 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:58:29,374 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 303.0) internal successors, (2424), 8 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states 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:58:29,374 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 487 flow. Second operand 7 states and 980 transitions. [2023-11-19 07:58:29,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 155 transitions, 1358 flow [2023-11-19 07:58:29,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 155 transitions, 1281 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-19 07:58:29,402 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 587 flow [2023-11-19 07:58:29,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=587, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-11-19 07:58:29,403 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2023-11-19 07:58:29,403 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 587 flow [2023-11-19 07:58:29,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states 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:58:29,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:29,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:29,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:58:29,404 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:29,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1827772425, now seen corresponding path program 1 times [2023-11-19 07:58:29,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:29,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183367268] [2023-11-19 07:58:29,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:30,878 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:58:30,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:30,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183367268] [2023-11-19 07:58:30,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183367268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:30,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:30,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:58:30,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516644320] [2023-11-19 07:58:30,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:30,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:58:30,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:30,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:58:30,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:58:30,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 303 [2023-11-19 07:58:30,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 587 flow. Second operand has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 states 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:58:30,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:30,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 303 [2023-11-19 07:58:30,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:32,614 INFO L124 PetriNetUnfolderBase]: 5737/9612 cut-off events. [2023-11-19 07:58:32,614 INFO L125 PetriNetUnfolderBase]: For 25449/25663 co-relation queries the response was YES. [2023-11-19 07:58:32,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39705 conditions, 9612 events. 5737/9612 cut-off events. For 25449/25663 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 68289 event pairs, 741 based on Foata normal form. 88/9501 useless extension candidates. Maximal degree in co-relation 39685. Up to 3377 conditions per place. [2023-11-19 07:58:32,670 INFO L140 encePairwiseOnDemand]: 296/303 looper letters, 144 selfloop transitions, 10 changer transitions 36/211 dead transitions. [2023-11-19 07:58:32,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 211 transitions, 2078 flow [2023-11-19 07:58:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:58:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:58:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2023-11-19 07:58:32,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807480748074808 [2023-11-19 07:58:32,675 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 874 transitions. [2023-11-19 07:58:32,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 874 transitions. [2023-11-19 07:58:32,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:32,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 874 transitions. [2023-11-19 07:58:32,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.66666666666666) internal successors, (874), 6 states have internal predecessors, (874), 0 states have call successors, (0), 0 states 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:58:32,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states 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:58:32,685 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states 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:58:32,685 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 587 flow. Second operand 6 states and 874 transitions. [2023-11-19 07:58:32,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 211 transitions, 2078 flow [2023-11-19 07:58:33,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 211 transitions, 1787 flow, removed 118 selfloop flow, removed 2 redundant places. [2023-11-19 07:58:33,477 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 632 flow [2023-11-19 07:58:33,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2023-11-19 07:58:33,478 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2023-11-19 07:58:33,479 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 632 flow [2023-11-19 07:58:33,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 states 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:58:33,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:33,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:33,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:58:33,480 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:33,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash -47979752, now seen corresponding path program 1 times [2023-11-19 07:58:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:33,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114175312] [2023-11-19 07:58:33,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:33,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:33,771 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:58:33,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:33,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114175312] [2023-11-19 07:58:33,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114175312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:33,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:33,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:58:33,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510037838] [2023-11-19 07:58:33,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:33,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:58:33,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:33,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:58:33,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:58:33,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 303 [2023-11-19 07:58:33,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 632 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states 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:58:33,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:33,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 303 [2023-11-19 07:58:33,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:36,470 INFO L124 PetriNetUnfolderBase]: 9967/16013 cut-off events. [2023-11-19 07:58:36,470 INFO L125 PetriNetUnfolderBase]: For 44627/44627 co-relation queries the response was YES. [2023-11-19 07:58:36,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66397 conditions, 16013 events. 9967/16013 cut-off events. For 44627/44627 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 111061 event pairs, 2616 based on Foata normal form. 25/16038 useless extension candidates. Maximal degree in co-relation 66373. Up to 8811 conditions per place. [2023-11-19 07:58:36,579 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 78 selfloop transitions, 13 changer transitions 43/134 dead transitions. [2023-11-19 07:58:36,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 134 transitions, 1281 flow [2023-11-19 07:58:36,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:58:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:58:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2023-11-19 07:58:36,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645214521452145 [2023-11-19 07:58:36,584 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2023-11-19 07:58:36,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2023-11-19 07:58:36,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:36,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2023-11-19 07:58:36,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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:58:36,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states 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:58:36,592 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states 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:58:36,593 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 632 flow. Second operand 4 states and 563 transitions. [2023-11-19 07:58:36,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 134 transitions, 1281 flow [2023-11-19 07:58:38,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 134 transitions, 1261 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 07:58:38,166 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 506 flow [2023-11-19 07:58:38,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=506, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2023-11-19 07:58:38,167 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-11-19 07:58:38,167 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 506 flow [2023-11-19 07:58:38,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states 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:58:38,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:38,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:38,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:58:38,169 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:38,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash -279587355, now seen corresponding path program 1 times [2023-11-19 07:58:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91055515] [2023-11-19 07:58:38,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:58:38,489 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:58:38,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:58:38,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91055515] [2023-11-19 07:58:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91055515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:58:38,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:58:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:58:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135218880] [2023-11-19 07:58:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:58:38,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:58:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:58:38,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:58:38,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:58:38,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 303 [2023-11-19 07:58:38,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 506 flow. Second operand has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states 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:58:38,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:58:38,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 303 [2023-11-19 07:58:38,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:58:39,372 INFO L124 PetriNetUnfolderBase]: 3222/5401 cut-off events. [2023-11-19 07:58:39,372 INFO L125 PetriNetUnfolderBase]: For 12731/12904 co-relation queries the response was YES. [2023-11-19 07:58:39,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21051 conditions, 5401 events. 3222/5401 cut-off events. For 12731/12904 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 35158 event pairs, 501 based on Foata normal form. 142/5423 useless extension candidates. Maximal degree in co-relation 21025. Up to 2016 conditions per place. [2023-11-19 07:58:39,393 INFO L140 encePairwiseOnDemand]: 296/303 looper letters, 51 selfloop transitions, 18 changer transitions 57/133 dead transitions. [2023-11-19 07:58:39,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 133 transitions, 1223 flow [2023-11-19 07:58:39,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:58:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:58:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1094 transitions. [2023-11-19 07:58:39,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4513201320132013 [2023-11-19 07:58:39,398 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1094 transitions. [2023-11-19 07:58:39,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1094 transitions. [2023-11-19 07:58:39,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:58:39,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1094 transitions. [2023-11-19 07:58:39,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.75) internal successors, (1094), 8 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states 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:58:39,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states 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:58:39,408 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states 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:58:39,408 INFO L175 Difference]: Start difference. First operand has 80 places, 61 transitions, 506 flow. Second operand 8 states and 1094 transitions. [2023-11-19 07:58:39,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 133 transitions, 1223 flow [2023-11-19 07:58:39,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 133 transitions, 1112 flow, removed 34 selfloop flow, removed 7 redundant places. [2023-11-19 07:58:39,653 INFO L231 Difference]: Finished difference. Result has 81 places, 47 transitions, 347 flow [2023-11-19 07:58:39,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=347, PETRI_PLACES=81, PETRI_TRANSITIONS=47} [2023-11-19 07:58:39,653 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2023-11-19 07:58:39,653 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 47 transitions, 347 flow [2023-11-19 07:58:39,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states 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:58:39,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:58:39,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:39,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:58:39,655 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:58:39,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:58:39,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1891480513, now seen corresponding path program 1 times [2023-11-19 07:58:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:58:39,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278294545] [2023-11-19 07:58:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:58:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:58:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:58:39,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:58:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:58:39,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:58:39,869 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:58:39,870 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-19 07:58:39,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-19 07:58:39,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-19 07:58:39,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-19 07:58:39,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-19 07:58:39,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-19 07:58:39,876 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-19 07:58:39,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-19 07:58:39,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-19 07:58:39,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-19 07:58:39,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-19 07:58:39,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-19 07:58:39,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-19 07:58:39,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-19 07:58:39,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-19 07:58:39,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-19 07:58:39,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:58:39,878 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:58:39,886 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:58:39,887 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:58:39,968 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:58:39,970 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:58:39,982 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:58:39,988 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 07:58:40,000 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 07:58:40,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:58:40 BasicIcfg [2023-11-19 07:58:40,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:58:40,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:58:40,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:58:40,018 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:58:40,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:58:02" (3/4) ... [2023-11-19 07:58:40,027 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:58:40,028 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:58:40,029 INFO L158 Benchmark]: Toolchain (without parser) took 38957.69ms. Allocated memory was 125.8MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 63.6MB in the beginning and 2.8GB in the end (delta: -2.8GB). Peak memory consumption was 452.1MB. Max. memory is 16.1GB. [2023-11-19 07:58:40,029 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 125.8MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:58:40,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.15ms. Allocated memory was 125.8MB in the beginning and 178.3MB in the end (delta: 52.4MB). Free memory was 63.4MB in the beginning and 125.3MB in the end (delta: -62.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2023-11-19 07:58:40,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.73ms. Allocated memory is still 178.3MB. Free memory was 125.3MB in the beginning and 122.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:58:40,030 INFO L158 Benchmark]: Boogie Preprocessor took 77.15ms. Allocated memory is still 178.3MB. Free memory was 122.8MB in the beginning and 120.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:58:40,031 INFO L158 Benchmark]: RCFGBuilder took 941.62ms. Allocated memory is still 178.3MB. Free memory was 120.7MB in the beginning and 135.6MB in the end (delta: -14.9MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2023-11-19 07:58:40,031 INFO L158 Benchmark]: TraceAbstraction took 37096.35ms. Allocated memory was 178.3MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 135.6MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 467.7MB. Max. memory is 16.1GB. [2023-11-19 07:58:40,031 INFO L158 Benchmark]: Witness Printer took 9.95ms. Allocated memory is still 3.3GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 2.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:58:40,034 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 125.8MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.15ms. Allocated memory was 125.8MB in the beginning and 178.3MB in the end (delta: 52.4MB). Free memory was 63.4MB in the beginning and 125.3MB in the end (delta: -62.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.73ms. Allocated memory is still 178.3MB. Free memory was 125.3MB in the beginning and 122.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.15ms. Allocated memory is still 178.3MB. Free memory was 122.8MB in the beginning and 120.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 941.62ms. Allocated memory is still 178.3MB. Free memory was 120.7MB in the beginning and 135.6MB in the end (delta: -14.9MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * TraceAbstraction took 37096.35ms. Allocated memory was 178.3MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 135.6MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 467.7MB. Max. memory is 16.1GB. * Witness Printer took 9.95ms. Allocated memory is still 3.3GB. Free memory was 2.8GB in the beginning and 2.8GB in the end (delta: 2.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 157 PlacesBefore, 52 PlacesAfterwards, 149 TransitionsBefore, 40 TransitionsAfterwards, 4378 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 150 TotalNumberOfCompositions, 9924 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5122, independent: 4919, independent conditional: 0, independent unconditional: 4919, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2355, independent: 2302, independent conditional: 0, independent unconditional: 2302, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5122, independent: 2617, independent conditional: 0, independent unconditional: 2617, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 2355, unknown conditional: 0, unknown unconditional: 2355] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 159, Positive conditional cache size: 0, Positive unconditional cache size: 159, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L866] 0 pthread_t t687; [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L868] 0 pthread_t t688; [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix026_power.opt_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 187 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 817 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 680 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2040 IncrementalHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 75 mSDtfsCounter, 2040 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=632occurred in iteration=11, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 1408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 07:58:40,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/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_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/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 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:58:42,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:58:43,123 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 07:58:43,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:58:43,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:58:43,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:58:43,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:58:43,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:58:43,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:58:43,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:58:43,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:58:43,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:58:43,196 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:58:43,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:58:43,198 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:58:43,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:58:43,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:58:43,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:58:43,200 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:58:43,202 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:58:43,202 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:58:43,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:58:43,204 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:58:43,204 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:58:43,205 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:58:43,205 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:58:43,206 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:58:43,206 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:58:43,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:58:43,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:58:43,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:58:43,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:58:43,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:58:43,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:58:43,211 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:58:43,212 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:58:43,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:58:43,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:58:43,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:58:43,214 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:58:43,214 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:58:43,215 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_911c26a0-4764-411e-9186-0c717500eebc/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_911c26a0-4764-411e-9186-0c717500eebc/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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2023-11-19 07:58:43,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:58:43,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:58:43,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:58:43,715 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:58:43,716 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:58:43,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2023-11-19 07:58:46,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:58:47,241 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:58:47,242 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2023-11-19 07:58:47,261 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/data/0b5305396/dc8c0c0e2e964f94b242ec59be687160/FLAGd5e957bdb [2023-11-19 07:58:47,277 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/data/0b5305396/dc8c0c0e2e964f94b242ec59be687160 [2023-11-19 07:58:47,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:58:47,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:58:47,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:47,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:58:47,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:58:47,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c217e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:47, skipping insertion in model container [2023-11-19 07:58:47,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:58:47" (1/1) ... [2023-11-19 07:58:47,353 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:58:47,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:47,971 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:58:48,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:58:48,120 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:58:48,121 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:58:48,129 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:58:48,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:48 WrapperNode [2023-11-19 07:58:48,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:58:48,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:48,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:58:48,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:58:48,139 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:58:48" (1/1) ... [2023-11-19 07:58:48,160 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:58:48" (1/1) ... [2023-11-19 07:58:48,189 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-19 07:58:48,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:58:48,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:58:48,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:58:48,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:58:48,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:48" (1/1) ... [2023-11-19 07:58:48,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:48" (1/1) ... [2023-11-19 07:58:48,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:48" (1/1) ... [2023-11-19 07:58:48,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:48" (1/1) ... [2023-11-19 07:58:48,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:48" (1/1) ... [2023-11-19 07:58:48,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:48" (1/1) ... [2023-11-19 07:58:48,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:48" (1/1) ... [2023-11-19 07:58:48,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:48" (1/1) ... [2023-11-19 07:58:48,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:58:48,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:58:48,265 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:58:48,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:58:48,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:58:48" (1/1) ... [2023-11-19 07:58:48,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:58:48,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:58:48,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/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:58:48,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_911c26a0-4764-411e-9186-0c717500eebc/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:58:48,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:58:48,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:58:48,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:58:48,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:58:48,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 07:58:48,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:58:48,366 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:58:48,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:58:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:58:48,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:58:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:58:48,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:58:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:58:48,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:58:48,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:58:48,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:58:48,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:58:48,372 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:58:48,565 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:58:48,567 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation