./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI --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 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:58:12,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:58:12,433 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:58:12,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:58:12,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:58:12,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:58:12,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:58:12,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:58:12,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:58:12,493 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:58:12,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:58:12,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:58:12,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:58:12,497 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:58:12,497 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:58:12,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:58:12,498 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:58:12,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:58:12,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:58:12,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:58:12,501 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:58:12,502 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:58:12,502 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:58:12,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:58:12,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:58:12,504 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:58:12,504 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:58:12,504 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:58:12,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:58:12,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:58:12,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:58:12,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:58:12,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:58:12,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:58:12,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:58:12,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:58:12,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:58:12,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:58:12,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:58:12,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:58:12,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:58:12,510 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_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/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_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI 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 -> 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 [2023-11-24 21:58:12,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:58:12,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:58:12,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:58:12,915 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:58:12,916 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:58:12,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-11-24 21:58:16,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:58:16,388 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:58:16,389 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-11-24 21:58:16,417 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/data/5bddfeb58/e532f94cd9de44eeb1c952ab737d6ece/FLAGdff3f982c [2023-11-24 21:58:16,435 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/data/5bddfeb58/e532f94cd9de44eeb1c952ab737d6ece [2023-11-24 21:58:16,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:58:16,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:58:16,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:58:16,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:58:16,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:58:16,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:58:16" (1/1) ... [2023-11-24 21:58:16,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761470a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:16, skipping insertion in model container [2023-11-24 21:58:16,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:58:16" (1/1) ... [2023-11-24 21:58:16,525 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:58:17,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:58:17,103 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:58:17,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:58:17,243 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:58:17,243 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:58:17,249 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:58:17,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17 WrapperNode [2023-11-24 21:58:17,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:58:17,251 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:58:17,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:58:17,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:58:17,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,309 INFO L138 Inliner]: procedures = 175, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-11-24 21:58:17,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:58:17,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:58:17,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:58:17,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:58:17,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,399 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 13, 1, 1]. 76 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0]. The 7 writes are split as follows [0, 5, 1, 1]. [2023-11-24 21:58:17,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:58:17,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:58:17,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:58:17,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:58:17,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (1/1) ... [2023-11-24 21:58:17,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:58:17,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:58:17,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:58:17,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:58:17,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:58:17,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:58:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-24 21:58:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-24 21:58:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:58:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:58:17,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:58:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:58:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:58:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:58:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:58:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:58:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:58:17,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:58:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:58:17,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:58:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:58:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:58:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:58:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:58:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:58:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:58:17,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:58:17,550 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:58:17,777 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:58:17,779 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:58:18,239 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:58:18,723 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:58:18,723 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:58:18,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:18 BoogieIcfgContainer [2023-11-24 21:58:18,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:58:18,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:58:18,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:58:18,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:58:18,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:58:16" (1/3) ... [2023-11-24 21:58:18,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b023041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:58:18, skipping insertion in model container [2023-11-24 21:58:18,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:17" (2/3) ... [2023-11-24 21:58:18,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b023041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:58:18, skipping insertion in model container [2023-11-24 21:58:18,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:18" (3/3) ... [2023-11-24 21:58:18,734 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-11-24 21:58:18,756 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:58:18,756 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-24 21:58:18,756 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:58:18,840 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:58:18,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 64 transitions, 136 flow [2023-11-24 21:58:18,915 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-24 21:58:18,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:58:18,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 193 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-11-24 21:58:18,920 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 64 transitions, 136 flow [2023-11-24 21:58:18,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 62 transitions, 130 flow [2023-11-24 21:58:18,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:58:18,942 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;@2809817, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:58:18,942 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-11-24 21:58:18,946 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:58:18,946 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:58:18,946 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:58:18,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:18,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:58:18,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:18,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash 18805, now seen corresponding path program 1 times [2023-11-24 21:58:18,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:18,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043266755] [2023-11-24 21:58:18,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:18,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:19,346 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-24 21:58:19,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043266755] [2023-11-24 21:58:19,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043266755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:19,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:19,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:19,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419444869] [2023-11-24 21:58:19,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:19,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:19,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:19,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:19,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:19,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2023-11-24 21:58:19,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:19,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:19,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2023-11-24 21:58:19,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:20,121 INFO L124 PetriNetUnfolderBase]: 1234/2286 cut-off events. [2023-11-24 21:58:20,122 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-24 21:58:20,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4298 conditions, 2286 events. 1234/2286 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 16953 event pairs, 1064 based on Foata normal form. 100/1299 useless extension candidates. Maximal degree in co-relation 4285. Up to 1726 conditions per place. [2023-11-24 21:58:20,152 INFO L140 encePairwiseOnDemand]: 49/64 looper letters, 43 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-24 21:58:20,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 218 flow [2023-11-24 21:58:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-24 21:58:20,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2023-11-24 21:58:20,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-24 21:58:20,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-24 21:58:20,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:20,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-24 21:58:20,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:20,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:20,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:20,183 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 130 flow. Second operand 3 states and 122 transitions. [2023-11-24 21:58:20,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 218 flow [2023-11-24 21:58:20,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:20,191 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 104 flow [2023-11-24 21:58:20,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-11-24 21:58:20,202 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -12 predicate places. [2023-11-24 21:58:20,203 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 104 flow [2023-11-24 21:58:20,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:20,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:20,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:58:20,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:58:20,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:20,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:20,204 INFO L85 PathProgramCache]: Analyzing trace with hash 18806, now seen corresponding path program 1 times [2023-11-24 21:58:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:20,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48679356] [2023-11-24 21:58:20,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:20,366 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-24 21:58:20,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:20,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48679356] [2023-11-24 21:58:20,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48679356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:20,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:20,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:20,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304758003] [2023-11-24 21:58:20,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:20,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:20,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:20,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:20,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:20,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2023-11-24 21:58:20,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:20,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:20,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2023-11-24 21:58:20,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:21,030 INFO L124 PetriNetUnfolderBase]: 1234/2285 cut-off events. [2023-11-24 21:58:21,031 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-24 21:58:21,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4346 conditions, 2285 events. 1234/2285 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 16888 event pairs, 1064 based on Foata normal form. 1/1199 useless extension candidates. Maximal degree in co-relation 4335. Up to 1725 conditions per place. [2023-11-24 21:58:21,055 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 42 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-24 21:58:21,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 216 flow [2023-11-24 21:58:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2023-11-24 21:58:21,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2023-11-24 21:58:21,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 102 transitions. [2023-11-24 21:58:21,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 102 transitions. [2023-11-24 21:58:21,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:21,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 102 transitions. [2023-11-24 21:58:21,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:21,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:21,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:21,071 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 104 flow. Second operand 3 states and 102 transitions. [2023-11-24 21:58:21,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 216 flow [2023-11-24 21:58:21,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:21,079 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 102 flow [2023-11-24 21:58:21,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-11-24 21:58:21,081 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -13 predicate places. [2023-11-24 21:58:21,082 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 102 flow [2023-11-24 21:58:21,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:21,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:21,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:21,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:58:21,090 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:21,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:21,100 INFO L85 PathProgramCache]: Analyzing trace with hash 560787796, now seen corresponding path program 1 times [2023-11-24 21:58:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:21,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300720866] [2023-11-24 21:58:21,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:58:21,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:21,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300720866] [2023-11-24 21:58:21,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300720866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:21,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:21,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:21,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926947237] [2023-11-24 21:58:21,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:21,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:21,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:21,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2023-11-24 21:58:21,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:21,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:21,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2023-11-24 21:58:21,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:21,774 INFO L124 PetriNetUnfolderBase]: 1238/2284 cut-off events. [2023-11-24 21:58:21,775 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-24 21:58:21,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 2284 events. 1238/2284 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 16900 event pairs, 620 based on Foata normal form. 0/1206 useless extension candidates. Maximal degree in co-relation 4343. Up to 1728 conditions per place. [2023-11-24 21:58:21,795 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 43 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-24 21:58:21,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 216 flow [2023-11-24 21:58:21,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2023-11-24 21:58:21,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2023-11-24 21:58:21,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 100 transitions. [2023-11-24 21:58:21,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 100 transitions. [2023-11-24 21:58:21,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:21,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 100 transitions. [2023-11-24 21:58:21,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:21,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:21,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:21,805 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 102 flow. Second operand 3 states and 100 transitions. [2023-11-24 21:58:21,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 216 flow [2023-11-24 21:58:21,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:21,810 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 100 flow [2023-11-24 21:58:21,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-11-24 21:58:21,812 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -14 predicate places. [2023-11-24 21:58:21,812 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 100 flow [2023-11-24 21:58:21,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:21,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:21,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:21,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:58:21,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:21,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:21,814 INFO L85 PathProgramCache]: Analyzing trace with hash 560787797, now seen corresponding path program 1 times [2023-11-24 21:58:21,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:21,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825752608] [2023-11-24 21:58:21,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:21,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:21,956 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-24 21:58:21,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825752608] [2023-11-24 21:58:21,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825752608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:21,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:21,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:21,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745584402] [2023-11-24 21:58:21,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:21,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:21,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:21,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:21,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:21,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2023-11-24 21:58:21,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:21,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:21,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2023-11-24 21:58:21,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:22,508 INFO L124 PetriNetUnfolderBase]: 1234/2268 cut-off events. [2023-11-24 21:58:22,508 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-24 21:58:22,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4333 conditions, 2268 events. 1234/2268 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 16998 event pairs, 1070 based on Foata normal form. 5/1186 useless extension candidates. Maximal degree in co-relation 4323. Up to 1719 conditions per place. [2023-11-24 21:58:22,531 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 42 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-24 21:58:22,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 212 flow [2023-11-24 21:58:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2023-11-24 21:58:22,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2023-11-24 21:58:22,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 102 transitions. [2023-11-24 21:58:22,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 102 transitions. [2023-11-24 21:58:22,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:22,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 102 transitions. [2023-11-24 21:58:22,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:22,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:22,539 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:22,539 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 100 flow. Second operand 3 states and 102 transitions. [2023-11-24 21:58:22,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 212 flow [2023-11-24 21:58:22,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:22,543 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 98 flow [2023-11-24 21:58:22,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-11-24 21:58:22,546 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -15 predicate places. [2023-11-24 21:58:22,546 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 98 flow [2023-11-24 21:58:22,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:22,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:22,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:22,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:58:22,548 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:22,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash 560789738, now seen corresponding path program 1 times [2023-11-24 21:58:22,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:22,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81849700] [2023-11-24 21:58:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:22,675 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-24 21:58:22,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:22,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81849700] [2023-11-24 21:58:22,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81849700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:22,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:22,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:22,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962418087] [2023-11-24 21:58:22,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:22,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:58:22,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:22,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:58:22,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:58:22,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2023-11-24 21:58:22,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:22,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:22,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2023-11-24 21:58:22,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:23,071 INFO L124 PetriNetUnfolderBase]: 675/1367 cut-off events. [2023-11-24 21:58:23,071 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-24 21:58:23,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1367 events. 675/1367 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9696 event pairs, 502 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 2564. Up to 792 conditions per place. [2023-11-24 21:58:23,083 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 44 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-11-24 21:58:23,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 230 flow [2023-11-24 21:58:23,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2023-11-24 21:58:23,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52734375 [2023-11-24 21:58:23,086 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 135 transitions. [2023-11-24 21:58:23,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 135 transitions. [2023-11-24 21:58:23,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:23,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 135 transitions. [2023-11-24 21:58:23,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,088 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,088 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 98 flow. Second operand 4 states and 135 transitions. [2023-11-24 21:58:23,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 230 flow [2023-11-24 21:58:23,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:23,091 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 138 flow [2023-11-24 21:58:23,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-11-24 21:58:23,092 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -13 predicate places. [2023-11-24 21:58:23,093 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 138 flow [2023-11-24 21:58:23,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:23,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:23,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:58:23,094 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:23,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 560789739, now seen corresponding path program 1 times [2023-11-24 21:58:23,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:23,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715532341] [2023-11-24 21:58:23,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:23,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:23,176 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-24 21:58:23,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:23,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715532341] [2023-11-24 21:58:23,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715532341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:23,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:23,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:23,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532074085] [2023-11-24 21:58:23,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:23,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:23,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:23,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:23,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:23,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2023-11-24 21:58:23,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:23,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2023-11-24 21:58:23,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:23,360 INFO L124 PetriNetUnfolderBase]: 240/560 cut-off events. [2023-11-24 21:58:23,360 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2023-11-24 21:58:23,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1296 conditions, 560 events. 240/560 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3580 event pairs, 222 based on Foata normal form. 136/648 useless extension candidates. Maximal degree in co-relation 1282. Up to 451 conditions per place. [2023-11-24 21:58:23,365 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 25 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-11-24 21:58:23,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 178 flow [2023-11-24 21:58:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-24 21:58:23,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4635416666666667 [2023-11-24 21:58:23,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-24 21:58:23,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-24 21:58:23,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:23,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-24 21:58:23,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,369 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 138 flow. Second operand 3 states and 89 transitions. [2023-11-24 21:58:23,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 178 flow [2023-11-24 21:58:23,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 40 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:58:23,373 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 126 flow [2023-11-24 21:58:23,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-24 21:58:23,377 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-11-24 21:58:23,377 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 126 flow [2023-11-24 21:58:23,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:23,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:23,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:58:23,378 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:23,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:23,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1885176154, now seen corresponding path program 1 times [2023-11-24 21:58:23,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:23,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747496575] [2023-11-24 21:58:23,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:23,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:23,499 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-24 21:58:23,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:23,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747496575] [2023-11-24 21:58:23,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747496575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:23,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:23,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:23,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285295856] [2023-11-24 21:58:23,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:23,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:23,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:23,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:23,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:23,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2023-11-24 21:58:23,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:23,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2023-11-24 21:58:23,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:23,686 INFO L124 PetriNetUnfolderBase]: 226/600 cut-off events. [2023-11-24 21:58:23,686 INFO L125 PetriNetUnfolderBase]: For 178/181 co-relation queries the response was YES. [2023-11-24 21:58:23,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 600 events. 226/600 cut-off events. For 178/181 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3855 event pairs, 72 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 1293. Up to 311 conditions per place. [2023-11-24 21:58:23,692 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 41 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2023-11-24 21:58:23,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 279 flow [2023-11-24 21:58:23,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:23,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2023-11-24 21:58:23,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2023-11-24 21:58:23,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 101 transitions. [2023-11-24 21:58:23,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 101 transitions. [2023-11-24 21:58:23,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:23,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 101 transitions. [2023-11-24 21:58:23,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,696 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 126 flow. Second operand 3 states and 101 transitions. [2023-11-24 21:58:23,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 279 flow [2023-11-24 21:58:23,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:58:23,699 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 138 flow [2023-11-24 21:58:23,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-11-24 21:58:23,700 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2023-11-24 21:58:23,700 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 138 flow [2023-11-24 21:58:23,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:23,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:23,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:58:23,701 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:23,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash -821887507, now seen corresponding path program 1 times [2023-11-24 21:58:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:23,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177193312] [2023-11-24 21:58:23,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:23,794 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-24 21:58:23,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:23,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177193312] [2023-11-24 21:58:23,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177193312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:23,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:23,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:23,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292452009] [2023-11-24 21:58:23,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:23,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:58:23,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:23,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:58:23,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:58:23,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2023-11-24 21:58:23,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:23,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:23,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2023-11-24 21:58:23,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:24,031 INFO L124 PetriNetUnfolderBase]: 224/557 cut-off events. [2023-11-24 21:58:24,031 INFO L125 PetriNetUnfolderBase]: For 265/268 co-relation queries the response was YES. [2023-11-24 21:58:24,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 557 events. 224/557 cut-off events. For 265/268 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3497 event pairs, 71 based on Foata normal form. 0/545 useless extension candidates. Maximal degree in co-relation 1360. Up to 232 conditions per place. [2023-11-24 21:58:24,039 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 35 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-11-24 21:58:24,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 261 flow [2023-11-24 21:58:24,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2023-11-24 21:58:24,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48046875 [2023-11-24 21:58:24,041 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 123 transitions. [2023-11-24 21:58:24,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 123 transitions. [2023-11-24 21:58:24,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:24,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 123 transitions. [2023-11-24 21:58:24,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:24,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:24,043 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:24,043 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 138 flow. Second operand 4 states and 123 transitions. [2023-11-24 21:58:24,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 261 flow [2023-11-24 21:58:24,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 255 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:24,046 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 147 flow [2023-11-24 21:58:24,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-11-24 21:58:24,050 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2023-11-24 21:58:24,050 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 147 flow [2023-11-24 21:58:24,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:24,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:24,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:24,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:58:24,051 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:24,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:24,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1559587770, now seen corresponding path program 1 times [2023-11-24 21:58:24,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:24,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814293048] [2023-11-24 21:58:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:24,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:24,288 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-24 21:58:24,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:24,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814293048] [2023-11-24 21:58:24,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814293048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:24,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:24,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:24,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664051758] [2023-11-24 21:58:24,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:24,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:24,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:24,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:24,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:58:24,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2023-11-24 21:58:24,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:24,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:24,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2023-11-24 21:58:24,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:24,550 INFO L124 PetriNetUnfolderBase]: 214/588 cut-off events. [2023-11-24 21:58:24,550 INFO L125 PetriNetUnfolderBase]: For 286/289 co-relation queries the response was YES. [2023-11-24 21:58:24,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 588 events. 214/588 cut-off events. For 286/289 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3816 event pairs, 76 based on Foata normal form. 8/581 useless extension candidates. Maximal degree in co-relation 1389. Up to 294 conditions per place. [2023-11-24 21:58:24,555 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 39 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2023-11-24 21:58:24,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 291 flow [2023-11-24 21:58:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2023-11-24 21:58:24,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4609375 [2023-11-24 21:58:24,557 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 118 transitions. [2023-11-24 21:58:24,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 118 transitions. [2023-11-24 21:58:24,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:24,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 118 transitions. [2023-11-24 21:58:24,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:24,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:24,559 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:24,559 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 147 flow. Second operand 4 states and 118 transitions. [2023-11-24 21:58:24,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 291 flow [2023-11-24 21:58:24,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:24,561 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 140 flow [2023-11-24 21:58:24,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-11-24 21:58:24,562 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2023-11-24 21:58:24,563 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 140 flow [2023-11-24 21:58:24,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:24,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:24,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:24,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:58:24,563 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:24,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:24,564 INFO L85 PathProgramCache]: Analyzing trace with hash 431845814, now seen corresponding path program 1 times [2023-11-24 21:58:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:24,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828353445] [2023-11-24 21:58:24,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:24,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:24,995 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-24 21:58:24,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:24,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828353445] [2023-11-24 21:58:24,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828353445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:24,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:24,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:58:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875867876] [2023-11-24 21:58:24,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:24,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:58:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:24,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:58:24,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:58:25,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2023-11-24 21:58:25,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 140 flow. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:25,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:25,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2023-11-24 21:58:25,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:25,458 INFO L124 PetriNetUnfolderBase]: 337/792 cut-off events. [2023-11-24 21:58:25,458 INFO L125 PetriNetUnfolderBase]: For 445/448 co-relation queries the response was YES. [2023-11-24 21:58:25,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 792 events. 337/792 cut-off events. For 445/448 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5342 event pairs, 188 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 1903. Up to 230 conditions per place. [2023-11-24 21:58:25,465 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 53 selfloop transitions, 7 changer transitions 2/74 dead transitions. [2023-11-24 21:58:25,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 388 flow [2023-11-24 21:58:25,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:58:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:58:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2023-11-24 21:58:25,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2023-11-24 21:58:25,467 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 160 transitions. [2023-11-24 21:58:25,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 160 transitions. [2023-11-24 21:58:25,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:25,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 160 transitions. [2023-11-24 21:58:25,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:25,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:25,470 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:25,470 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 140 flow. Second operand 6 states and 160 transitions. [2023-11-24 21:58:25,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 388 flow [2023-11-24 21:58:25,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:25,473 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 186 flow [2023-11-24 21:58:25,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-11-24 21:58:25,474 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -9 predicate places. [2023-11-24 21:58:25,474 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 186 flow [2023-11-24 21:58:25,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:25,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:25,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:58:25,475 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:25,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 431844970, now seen corresponding path program 1 times [2023-11-24 21:58:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:25,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823220488] [2023-11-24 21:58:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:25,624 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-24 21:58:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:25,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823220488] [2023-11-24 21:58:25,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823220488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:25,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:25,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:25,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616514202] [2023-11-24 21:58:25,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:25,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:58:25,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:25,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:58:25,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:58:25,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2023-11-24 21:58:25,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:25,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:25,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2023-11-24 21:58:25,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:25,878 INFO L124 PetriNetUnfolderBase]: 438/923 cut-off events. [2023-11-24 21:58:25,879 INFO L125 PetriNetUnfolderBase]: For 725/745 co-relation queries the response was YES. [2023-11-24 21:58:25,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 923 events. 438/923 cut-off events. For 725/745 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5397 event pairs, 55 based on Foata normal form. 35/943 useless extension candidates. Maximal degree in co-relation 2250. Up to 586 conditions per place. [2023-11-24 21:58:25,885 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 42 selfloop transitions, 4 changer transitions 2/59 dead transitions. [2023-11-24 21:58:25,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 342 flow [2023-11-24 21:58:25,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2023-11-24 21:58:25,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4296875 [2023-11-24 21:58:25,887 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 110 transitions. [2023-11-24 21:58:25,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 110 transitions. [2023-11-24 21:58:25,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:25,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 110 transitions. [2023-11-24 21:58:25,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:25,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:25,890 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:25,890 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 186 flow. Second operand 4 states and 110 transitions. [2023-11-24 21:58:25,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 342 flow [2023-11-24 21:58:25,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 328 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-24 21:58:25,897 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 192 flow [2023-11-24 21:58:25,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2023-11-24 21:58:25,898 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -5 predicate places. [2023-11-24 21:58:25,898 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 192 flow [2023-11-24 21:58:25,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:25,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:25,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:25,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:58:25,899 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:25,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 7257662, now seen corresponding path program 1 times [2023-11-24 21:58:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:25,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812587364] [2023-11-24 21:58:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:25,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:26,195 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-24 21:58:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812587364] [2023-11-24 21:58:26,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812587364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:26,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:26,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:58:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365725252] [2023-11-24 21:58:26,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:26,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:26,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:26,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:26,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:58:26,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2023-11-24 21:58:26,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:26,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:26,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2023-11-24 21:58:26,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:26,358 INFO L124 PetriNetUnfolderBase]: 171/383 cut-off events. [2023-11-24 21:58:26,359 INFO L125 PetriNetUnfolderBase]: For 276/281 co-relation queries the response was YES. [2023-11-24 21:58:26,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 383 events. 171/383 cut-off events. For 276/281 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1627 event pairs, 21 based on Foata normal form. 26/402 useless extension candidates. Maximal degree in co-relation 1018. Up to 125 conditions per place. [2023-11-24 21:58:26,362 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 28 selfloop transitions, 6 changer transitions 4/49 dead transitions. [2023-11-24 21:58:26,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 270 flow [2023-11-24 21:58:26,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:58:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:58:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2023-11-24 21:58:26,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2023-11-24 21:58:26,364 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 121 transitions. [2023-11-24 21:58:26,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 121 transitions. [2023-11-24 21:58:26,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:26,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 121 transitions. [2023-11-24 21:58:26,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:26,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:26,366 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:26,366 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 192 flow. Second operand 5 states and 121 transitions. [2023-11-24 21:58:26,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 270 flow [2023-11-24 21:58:26,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 250 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-24 21:58:26,370 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 141 flow [2023-11-24 21:58:26,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2023-11-24 21:58:26,370 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -9 predicate places. [2023-11-24 21:58:26,371 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 141 flow [2023-11-24 21:58:26,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:26,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:26,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:26,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:58:26,372 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:26,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:26,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1510978258, now seen corresponding path program 1 times [2023-11-24 21:58:26,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:26,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052711326] [2023-11-24 21:58:26,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:26,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:26,701 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-24 21:58:26,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:26,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052711326] [2023-11-24 21:58:26,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052711326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:26,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:26,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:58:26,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229688167] [2023-11-24 21:58:26,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:26,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:58:26,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:26,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:58:26,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:58:26,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2023-11-24 21:58:26,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 34 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:26,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:26,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2023-11-24 21:58:26,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:26,944 INFO L124 PetriNetUnfolderBase]: 200/518 cut-off events. [2023-11-24 21:58:26,944 INFO L125 PetriNetUnfolderBase]: For 306/308 co-relation queries the response was YES. [2023-11-24 21:58:26,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 518 events. 200/518 cut-off events. For 306/308 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2691 event pairs, 64 based on Foata normal form. 8/512 useless extension candidates. Maximal degree in co-relation 1250. Up to 159 conditions per place. [2023-11-24 21:58:26,948 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 35 selfloop transitions, 6 changer transitions 0/55 dead transitions. [2023-11-24 21:58:26,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 55 transitions, 286 flow [2023-11-24 21:58:26,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:58:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:58:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2023-11-24 21:58:26,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2023-11-24 21:58:26,950 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 148 transitions. [2023-11-24 21:58:26,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 148 transitions. [2023-11-24 21:58:26,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:26,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 148 transitions. [2023-11-24 21:58:26,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:26,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:26,953 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:26,953 INFO L175 Difference]: Start difference. First operand has 58 places, 34 transitions, 141 flow. Second operand 6 states and 148 transitions. [2023-11-24 21:58:26,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 55 transitions, 286 flow [2023-11-24 21:58:26,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 246 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-11-24 21:58:26,956 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 148 flow [2023-11-24 21:58:26,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2023-11-24 21:58:26,957 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -12 predicate places. [2023-11-24 21:58:26,957 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 148 flow [2023-11-24 21:58:26,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:26,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:26,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:26,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:58:26,958 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:26,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1492029764, now seen corresponding path program 2 times [2023-11-24 21:58:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:26,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586976912] [2023-11-24 21:58:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:58:27,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:58:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:58:27,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:58:27,177 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:58:27,178 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (49 of 50 remaining) [2023-11-24 21:58:27,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2023-11-24 21:58:27,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2023-11-24 21:58:27,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2023-11-24 21:58:27,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2023-11-24 21:58:27,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2023-11-24 21:58:27,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2023-11-24 21:58:27,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2023-11-24 21:58:27,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2023-11-24 21:58:27,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2023-11-24 21:58:27,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2023-11-24 21:58:27,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2023-11-24 21:58:27,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2023-11-24 21:58:27,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2023-11-24 21:58:27,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2023-11-24 21:58:27,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2023-11-24 21:58:27,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2023-11-24 21:58:27,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2023-11-24 21:58:27,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2023-11-24 21:58:27,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2023-11-24 21:58:27,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2023-11-24 21:58:27,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2023-11-24 21:58:27,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2023-11-24 21:58:27,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2023-11-24 21:58:27,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2023-11-24 21:58:27,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2023-11-24 21:58:27,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2023-11-24 21:58:27,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2023-11-24 21:58:27,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2023-11-24 21:58:27,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (20 of 50 remaining) [2023-11-24 21:58:27,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2023-11-24 21:58:27,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2023-11-24 21:58:27,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2023-11-24 21:58:27,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2023-11-24 21:58:27,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2023-11-24 21:58:27,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2023-11-24 21:58:27,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2023-11-24 21:58:27,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2023-11-24 21:58:27,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2023-11-24 21:58:27,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2023-11-24 21:58:27,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2023-11-24 21:58:27,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2023-11-24 21:58:27,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2023-11-24 21:58:27,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2023-11-24 21:58:27,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2023-11-24 21:58:27,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2023-11-24 21:58:27,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2023-11-24 21:58:27,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2023-11-24 21:58:27,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2023-11-24 21:58:27,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2023-11-24 21:58:27,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:58:27,190 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:27,196 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:58:27,196 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:58:27,259 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-24 21:58:27,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated [2023-11-24 21:58:27,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:58:27 BasicIcfg [2023-11-24 21:58:27,290 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:58:27,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:58:27,290 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:58:27,290 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:58:27,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:18" (3/4) ... [2023-11-24 21:58:27,293 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:58:27,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:58:27,294 INFO L158 Benchmark]: Toolchain (without parser) took 10852.05ms. Allocated memory was 142.6MB in the beginning and 323.0MB in the end (delta: 180.4MB). Free memory was 100.8MB in the beginning and 224.0MB in the end (delta: -123.2MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2023-11-24 21:58:27,295 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 91.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:58:27,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 805.08ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 77.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 21:58:27,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.36ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:58:27,296 INFO L158 Benchmark]: Boogie Preprocessor took 135.67ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 111.0MB in the end (delta: -35.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-24 21:58:27,296 INFO L158 Benchmark]: RCFGBuilder took 1277.60ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 111.0MB in the beginning and 116.9MB in the end (delta: -5.9MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2023-11-24 21:58:27,297 INFO L158 Benchmark]: TraceAbstraction took 8562.77ms. Allocated memory was 172.0MB in the beginning and 323.0MB in the end (delta: 151.0MB). Free memory was 115.9MB in the beginning and 225.1MB in the end (delta: -109.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2023-11-24 21:58:27,297 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 323.0MB. Free memory was 225.1MB in the beginning and 224.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:58:27,299 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.32ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 77.6MB in the end (delta: 91.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 805.08ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 77.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.36ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 135.67ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 111.0MB in the end (delta: -35.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1277.60ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 111.0MB in the beginning and 116.9MB in the end (delta: -5.9MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8562.77ms. Allocated memory was 172.0MB in the beginning and 323.0MB in the end (delta: 151.0MB). Free memory was 115.9MB in the beginning and 225.1MB in the end (delta: -109.2MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 323.0MB. Free memory was 225.1MB in the beginning and 224.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] 0 pthread_t t1930; [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929={6:0}, t1930={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L772] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={6:0}, t1930={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={6:0}, t1930={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={6:0}, t1930={5:0}, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: -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: -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: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 815]: 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: 813]: 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 5 procedures, 97 locations, 50 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: 8.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 549 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 459 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1049 IncrementalHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 23 mSDtfsCounter, 1049 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=11, InterpolantAutomatonStates: 51, 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, 2.1s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 587 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-24 21:58:27,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI --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 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:58:30,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:58:30,198 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:58:30,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:58:30,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:58:30,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:58:30,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:58:30,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:58:30,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:58:30,264 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:58:30,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:58:30,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:58:30,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:58:30,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:58:30,269 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:58:30,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:58:30,270 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:58:30,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:58:30,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:58:30,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:58:30,273 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:58:30,273 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:58:30,274 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:58:30,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:58:30,275 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:58:30,275 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:58:30,276 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:58:30,276 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:58:30,277 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:58:30,278 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:58:30,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:58:30,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:58:30,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:58:30,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:58:30,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:58:30,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:58:30,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:58:30,283 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:58:30,283 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:58:30,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:58:30,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:58:30,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:58:30,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:58:30,285 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:58:30,286 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_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/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_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI 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 -> 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 [2023-11-24 21:58:30,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:58:30,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:58:30,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:58:30,711 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:58:30,712 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:58:30,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-11-24 21:58:33,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:58:34,324 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:58:34,325 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-11-24 21:58:34,347 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/data/f269f04e5/a37a0b22e7994282aafaab09405f727c/FLAG5200b6c4c [2023-11-24 21:58:34,370 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/data/f269f04e5/a37a0b22e7994282aafaab09405f727c [2023-11-24 21:58:34,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:58:34,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:58:34,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:58:34,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:58:34,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:58:34,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:58:34" (1/1) ... [2023-11-24 21:58:34,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7a3f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:34, skipping insertion in model container [2023-11-24 21:58:34,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:58:34" (1/1) ... [2023-11-24 21:58:34,468 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:58:34,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:58:34,962 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:58:35,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:58:35,159 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:58:35,159 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:58:35,168 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:58:35,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35 WrapperNode [2023-11-24 21:58:35,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:58:35,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:58:35,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:58:35,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:58:35,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,269 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2023-11-24 21:58:35,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:58:35,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:58:35,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:58:35,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:58:35,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,343 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 13, 1, 1]. 76 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0]. The 7 writes are split as follows [0, 5, 1, 1]. [2023-11-24 21:58:35,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:58:35,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:58:35,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:58:35,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:58:35,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (1/1) ... [2023-11-24 21:58:35,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:58:35,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:58:35,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:58:35,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:58:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-24 21:58:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-24 21:58:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-24 21:58:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-24 21:58:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:58:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:58:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:58:35,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:58:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 21:58:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 21:58:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 21:58:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-24 21:58:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 21:58:35,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 21:58:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 21:58:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-24 21:58:35,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-24 21:58:35,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-24 21:58:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-24 21:58:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-24 21:58:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:58:35,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:58:35,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:58:35,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:58:35,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:58:35,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:58:35,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:58:35,500 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:58:35,761 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:58:35,764 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:58:36,488 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:58:36,959 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:58:36,960 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:58:36,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:36 BoogieIcfgContainer [2023-11-24 21:58:36,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:58:36,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:58:36,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:58:36,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:58:36,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:58:34" (1/3) ... [2023-11-24 21:58:36,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e0a155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:58:36, skipping insertion in model container [2023-11-24 21:58:36,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:35" (2/3) ... [2023-11-24 21:58:36,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e0a155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:58:36, skipping insertion in model container [2023-11-24 21:58:36,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:36" (3/3) ... [2023-11-24 21:58:36,974 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-11-24 21:58:36,995 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:58:36,996 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-24 21:58:36,996 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:58:37,136 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:58:37,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 64 transitions, 136 flow [2023-11-24 21:58:37,264 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-24 21:58:37,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:58:37,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 193 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2023-11-24 21:58:37,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 64 transitions, 136 flow [2023-11-24 21:58:37,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 62 transitions, 130 flow [2023-11-24 21:58:37,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:58:37,293 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;@6d6156e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:58:37,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-11-24 21:58:37,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:58:37,298 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:58:37,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:58:37,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:37,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:58:37,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:37,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:37,307 INFO L85 PathProgramCache]: Analyzing trace with hash 18869, now seen corresponding path program 1 times [2023-11-24 21:58:37,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:37,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260239129] [2023-11-24 21:58:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:37,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:37,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:37,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:37,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-24 21:58:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:37,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:58:37,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:37,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-24 21:58:37,601 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-24 21:58:37,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:37,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:37,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260239129] [2023-11-24 21:58:37,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260239129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:37,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:37,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:37,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161583771] [2023-11-24 21:58:37,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:37,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:37,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:37,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:37,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2023-11-24 21:58:37,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:37,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:37,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2023-11-24 21:58:37,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:38,649 INFO L124 PetriNetUnfolderBase]: 1234/2286 cut-off events. [2023-11-24 21:58:38,649 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-24 21:58:38,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4298 conditions, 2286 events. 1234/2286 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 16953 event pairs, 1064 based on Foata normal form. 100/1299 useless extension candidates. Maximal degree in co-relation 4285. Up to 1726 conditions per place. [2023-11-24 21:58:38,684 INFO L140 encePairwiseOnDemand]: 49/64 looper letters, 43 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-24 21:58:38,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 218 flow [2023-11-24 21:58:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-24 21:58:38,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2023-11-24 21:58:38,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-24 21:58:38,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-24 21:58:38,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:38,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-24 21:58:38,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:38,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:38,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:38,719 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 130 flow. Second operand 3 states and 122 transitions. [2023-11-24 21:58:38,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 218 flow [2023-11-24 21:58:38,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:38,734 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 104 flow [2023-11-24 21:58:38,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-11-24 21:58:38,742 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -12 predicate places. [2023-11-24 21:58:38,742 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 104 flow [2023-11-24 21:58:38,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:38,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:38,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:58:38,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-24 21:58:38,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:38,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:38,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash 18870, now seen corresponding path program 1 times [2023-11-24 21:58:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:38,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563793567] [2023-11-24 21:58:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:38,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:38,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:38,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:38,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-24 21:58:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:39,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:58:39,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:39,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:58:39,127 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-24 21:58:39,128 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:39,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:39,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563793567] [2023-11-24 21:58:39,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563793567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:39,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:39,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:39,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004217702] [2023-11-24 21:58:39,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:39,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:39,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:39,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:39,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2023-11-24 21:58:39,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:39,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:39,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2023-11-24 21:58:39,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:39,855 INFO L124 PetriNetUnfolderBase]: 1234/2285 cut-off events. [2023-11-24 21:58:39,862 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-24 21:58:39,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4346 conditions, 2285 events. 1234/2285 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 16888 event pairs, 1064 based on Foata normal form. 1/1199 useless extension candidates. Maximal degree in co-relation 4335. Up to 1725 conditions per place. [2023-11-24 21:58:39,883 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 42 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-24 21:58:39,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 216 flow [2023-11-24 21:58:39,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2023-11-24 21:58:39,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2023-11-24 21:58:39,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 102 transitions. [2023-11-24 21:58:39,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 102 transitions. [2023-11-24 21:58:39,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:39,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 102 transitions. [2023-11-24 21:58:39,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:39,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:39,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:39,893 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 104 flow. Second operand 3 states and 102 transitions. [2023-11-24 21:58:39,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 216 flow [2023-11-24 21:58:39,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:39,901 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 102 flow [2023-11-24 21:58:39,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-11-24 21:58:39,902 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -13 predicate places. [2023-11-24 21:58:39,903 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 102 flow [2023-11-24 21:58:39,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:39,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:39,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:39,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:40,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:40,106 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:40,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:40,107 INFO L85 PathProgramCache]: Analyzing trace with hash 562696406, now seen corresponding path program 1 times [2023-11-24 21:58:40,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:40,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982320509] [2023-11-24 21:58:40,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:40,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:40,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:40,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:40,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-24 21:58:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:40,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:58:40,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:40,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-24 21:58:40,262 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-24 21:58:40,263 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:40,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:40,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982320509] [2023-11-24 21:58:40,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982320509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:40,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:40,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:40,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57783903] [2023-11-24 21:58:40,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:40,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:40,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:40,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:40,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2023-11-24 21:58:40,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:40,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:40,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2023-11-24 21:58:40,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:40,977 INFO L124 PetriNetUnfolderBase]: 1238/2284 cut-off events. [2023-11-24 21:58:40,977 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-24 21:58:40,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 2284 events. 1238/2284 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 16900 event pairs, 620 based on Foata normal form. 0/1206 useless extension candidates. Maximal degree in co-relation 4343. Up to 1728 conditions per place. [2023-11-24 21:58:41,004 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 43 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-24 21:58:41,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 216 flow [2023-11-24 21:58:41,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2023-11-24 21:58:41,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2023-11-24 21:58:41,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 100 transitions. [2023-11-24 21:58:41,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 100 transitions. [2023-11-24 21:58:41,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:41,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 100 transitions. [2023-11-24 21:58:41,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,015 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 102 flow. Second operand 3 states and 100 transitions. [2023-11-24 21:58:41,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 216 flow [2023-11-24 21:58:41,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:41,022 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 100 flow [2023-11-24 21:58:41,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-11-24 21:58:41,025 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -14 predicate places. [2023-11-24 21:58:41,025 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 100 flow [2023-11-24 21:58:41,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:41,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:41,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:41,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:41,229 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:41,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:41,229 INFO L85 PathProgramCache]: Analyzing trace with hash 562696407, now seen corresponding path program 1 times [2023-11-24 21:58:41,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:41,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522308702] [2023-11-24 21:58:41,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:41,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:41,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:41,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:41,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-24 21:58:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:41,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:58:41,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:41,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 21:58:41,377 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-24 21:58:41,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:41,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:41,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522308702] [2023-11-24 21:58:41,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522308702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:41,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:41,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:41,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053695344] [2023-11-24 21:58:41,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:41,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:41,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:41,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:41,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:41,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 64 [2023-11-24 21:58:41,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:41,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:41,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 64 [2023-11-24 21:58:41,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:42,006 INFO L124 PetriNetUnfolderBase]: 1234/2268 cut-off events. [2023-11-24 21:58:42,006 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-24 21:58:42,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4333 conditions, 2268 events. 1234/2268 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 16998 event pairs, 1070 based on Foata normal form. 5/1186 useless extension candidates. Maximal degree in co-relation 4323. Up to 1719 conditions per place. [2023-11-24 21:58:42,027 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 42 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-24 21:58:42,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 212 flow [2023-11-24 21:58:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2023-11-24 21:58:42,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2023-11-24 21:58:42,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 102 transitions. [2023-11-24 21:58:42,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 102 transitions. [2023-11-24 21:58:42,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:42,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 102 transitions. [2023-11-24 21:58:42,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:42,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:42,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:42,033 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 100 flow. Second operand 3 states and 102 transitions. [2023-11-24 21:58:42,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 212 flow [2023-11-24 21:58:42,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:42,037 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 98 flow [2023-11-24 21:58:42,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-11-24 21:58:42,038 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -15 predicate places. [2023-11-24 21:58:42,038 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 98 flow [2023-11-24 21:58:42,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:42,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:42,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:42,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:42,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:42,241 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:42,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash 562698348, now seen corresponding path program 1 times [2023-11-24 21:58:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354754048] [2023-11-24 21:58:42,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:42,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:42,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:42,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:42,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-24 21:58:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:42,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:58:42,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:42,405 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-24 21:58:42,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 21:58:42,444 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-24 21:58:42,444 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:42,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:42,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354754048] [2023-11-24 21:58:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354754048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886181300] [2023-11-24 21:58:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:42,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:42,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:42,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:42,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:42,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2023-11-24 21:58:42,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:42,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:42,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2023-11-24 21:58:42,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:42,855 INFO L124 PetriNetUnfolderBase]: 622/1204 cut-off events. [2023-11-24 21:58:42,856 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-11-24 21:58:42,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2288 conditions, 1204 events. 622/1204 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8173 event pairs, 502 based on Foata normal form. 0/762 useless extension candidates. Maximal degree in co-relation 2278. Up to 791 conditions per place. [2023-11-24 21:58:42,868 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 36 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-24 21:58:42,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 188 flow [2023-11-24 21:58:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2023-11-24 21:58:42,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2023-11-24 21:58:42,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 104 transitions. [2023-11-24 21:58:42,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 104 transitions. [2023-11-24 21:58:42,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:42,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 104 transitions. [2023-11-24 21:58:42,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:42,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:42,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:42,873 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 98 flow. Second operand 3 states and 104 transitions. [2023-11-24 21:58:42,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 188 flow [2023-11-24 21:58:42,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:42,876 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 104 flow [2023-11-24 21:58:42,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-11-24 21:58:42,877 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2023-11-24 21:58:42,878 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 104 flow [2023-11-24 21:58:42,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:42,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:42,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:42,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:43,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:43,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:43,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:43,082 INFO L85 PathProgramCache]: Analyzing trace with hash 562698349, now seen corresponding path program 1 times [2023-11-24 21:58:43,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225733788] [2023-11-24 21:58:43,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:43,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:43,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:43,087 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:43,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-24 21:58:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:43,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 21:58:43,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:43,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 21:58:43,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-24 21:58:43,321 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-24 21:58:43,321 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:43,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225733788] [2023-11-24 21:58:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225733788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:43,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:43,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:43,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416974634] [2023-11-24 21:58:43,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:43,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:43,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:43,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:43,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2023-11-24 21:58:43,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:43,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:43,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2023-11-24 21:58:43,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:43,557 INFO L124 PetriNetUnfolderBase]: 220/471 cut-off events. [2023-11-24 21:58:43,558 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-24 21:58:43,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 471 events. 220/471 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2751 event pairs, 220 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 925. Up to 391 conditions per place. [2023-11-24 21:58:43,562 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 22 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-11-24 21:58:43,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 37 transitions, 138 flow [2023-11-24 21:58:43,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-24 21:58:43,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4635416666666667 [2023-11-24 21:58:43,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-24 21:58:43,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-24 21:58:43,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:43,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-24 21:58:43,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:43,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:43,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:43,567 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 104 flow. Second operand 3 states and 89 transitions. [2023-11-24 21:58:43,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 37 transitions, 138 flow [2023-11-24 21:58:43,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 37 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:43,570 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 90 flow [2023-11-24 21:58:43,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-11-24 21:58:43,574 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-11-24 21:58:43,575 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 90 flow [2023-11-24 21:58:43,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:43,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:43,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:43,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:43,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:43,778 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:43,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash -396867556, now seen corresponding path program 1 times [2023-11-24 21:58:43,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:43,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515326182] [2023-11-24 21:58:43,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:43,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:43,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:43,780 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:43,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-24 21:58:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:43,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:58:43,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:43,947 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-24 21:58:43,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:43,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:43,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515326182] [2023-11-24 21:58:43,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515326182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:43,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:43,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:43,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773969130] [2023-11-24 21:58:43,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:43,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:58:43,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:43,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:58:43,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:58:43,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2023-11-24 21:58:43,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:43,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:43,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2023-11-24 21:58:43,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:44,207 INFO L124 PetriNetUnfolderBase]: 272/563 cut-off events. [2023-11-24 21:58:44,207 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-24 21:58:44,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 563 events. 272/563 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2925 event pairs, 32 based on Foata normal form. 20/545 useless extension candidates. Maximal degree in co-relation 1098. Up to 363 conditions per place. [2023-11-24 21:58:44,211 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 37 selfloop transitions, 4 changer transitions 1/53 dead transitions. [2023-11-24 21:58:44,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 208 flow [2023-11-24 21:58:44,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2023-11-24 21:58:44,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2023-11-24 21:58:44,213 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 112 transitions. [2023-11-24 21:58:44,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 112 transitions. [2023-11-24 21:58:44,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:44,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 112 transitions. [2023-11-24 21:58:44,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,216 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,216 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 90 flow. Second operand 4 states and 112 transitions. [2023-11-24 21:58:44,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 208 flow [2023-11-24 21:58:44,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:58:44,218 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 115 flow [2023-11-24 21:58:44,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-11-24 21:58:44,219 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-11-24 21:58:44,219 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 115 flow [2023-11-24 21:58:44,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:44,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:44,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:44,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:44,425 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:44,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:44,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2121170508, now seen corresponding path program 1 times [2023-11-24 21:58:44,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440733521] [2023-11-24 21:58:44,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:44,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:44,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:44,431 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:44,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-24 21:58:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:44,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:58:44,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:58:44,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:44,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:44,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440733521] [2023-11-24 21:58:44,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440733521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:44,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:44,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:58:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370468782] [2023-11-24 21:58:44,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:44,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:44,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:44,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:58:44,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 64 [2023-11-24 21:58:44,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:44,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 64 [2023-11-24 21:58:44,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:44,858 INFO L124 PetriNetUnfolderBase]: 104/233 cut-off events. [2023-11-24 21:58:44,858 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-11-24 21:58:44,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 233 events. 104/233 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 767 event pairs, 16 based on Foata normal form. 14/235 useless extension candidates. Maximal degree in co-relation 524. Up to 81 conditions per place. [2023-11-24 21:58:44,861 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 28 selfloop transitions, 6 changer transitions 2/47 dead transitions. [2023-11-24 21:58:44,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 200 flow [2023-11-24 21:58:44,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:58:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:58:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2023-11-24 21:58:44,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2023-11-24 21:58:44,863 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 123 transitions. [2023-11-24 21:58:44,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 123 transitions. [2023-11-24 21:58:44,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:44,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 123 transitions. [2023-11-24 21:58:44,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,865 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,866 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 115 flow. Second operand 5 states and 123 transitions. [2023-11-24 21:58:44,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 200 flow [2023-11-24 21:58:44,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 189 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-24 21:58:44,868 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 111 flow [2023-11-24 21:58:44,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2023-11-24 21:58:44,869 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2023-11-24 21:58:44,870 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 111 flow [2023-11-24 21:58:44,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:44,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:44,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:44,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:45,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:45,074 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:45,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:45,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1873384990, now seen corresponding path program 1 times [2023-11-24 21:58:45,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:45,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684884981] [2023-11-24 21:58:45,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:45,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:45,076 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:45,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-24 21:58:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:45,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:58:45,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:45,307 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-24 21:58:45,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:45,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:45,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684884981] [2023-11-24 21:58:45,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684884981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:45,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:45,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:45,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814942519] [2023-11-24 21:58:45,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:45,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:58:45,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:45,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:58:45,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:58:45,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2023-11-24 21:58:45,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:45,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:45,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2023-11-24 21:58:45,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:45,475 INFO L124 PetriNetUnfolderBase]: 60/175 cut-off events. [2023-11-24 21:58:45,475 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 21:58:45,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 175 events. 60/175 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 572 event pairs, 29 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 360. Up to 95 conditions per place. [2023-11-24 21:58:45,477 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 23 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-24 21:58:45,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 177 flow [2023-11-24 21:58:45,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2023-11-24 21:58:45,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4140625 [2023-11-24 21:58:45,481 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 106 transitions. [2023-11-24 21:58:45,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 106 transitions. [2023-11-24 21:58:45,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:45,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 106 transitions. [2023-11-24 21:58:45,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:45,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:45,484 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:45,484 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 111 flow. Second operand 4 states and 106 transitions. [2023-11-24 21:58:45,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 177 flow [2023-11-24 21:58:45,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 149 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-24 21:58:45,486 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 85 flow [2023-11-24 21:58:45,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-24 21:58:45,487 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -24 predicate places. [2023-11-24 21:58:45,487 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 85 flow [2023-11-24 21:58:45,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:45,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:45,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:45,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:45,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:45,691 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:45,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1821721141, now seen corresponding path program 1 times [2023-11-24 21:58:45,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:45,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335325917] [2023-11-24 21:58:45,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:45,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:45,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:45,693 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:45,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-24 21:58:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:45,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:58:45,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:45,972 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-24 21:58:45,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:45,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335325917] [2023-11-24 21:58:45,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335325917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:45,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:45,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:45,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981775385] [2023-11-24 21:58:45,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:45,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:45,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:45,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:45,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:58:46,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2023-11-24 21:58:46,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:46,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2023-11-24 21:58:46,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:46,167 INFO L124 PetriNetUnfolderBase]: 56/167 cut-off events. [2023-11-24 21:58:46,167 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-24 21:58:46,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 167 events. 56/167 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 544 event pairs, 29 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 312. Up to 95 conditions per place. [2023-11-24 21:58:46,169 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 20 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-11-24 21:58:46,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 141 flow [2023-11-24 21:58:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2023-11-24 21:58:46,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2023-11-24 21:58:46,171 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 103 transitions. [2023-11-24 21:58:46,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 103 transitions. [2023-11-24 21:58:46,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:46,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 103 transitions. [2023-11-24 21:58:46,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,173 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,174 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 85 flow. Second operand 4 states and 103 transitions. [2023-11-24 21:58:46,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 141 flow [2023-11-24 21:58:46,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:46,176 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 84 flow [2023-11-24 21:58:46,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-11-24 21:58:46,177 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -24 predicate places. [2023-11-24 21:58:46,177 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 84 flow [2023-11-24 21:58:46,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:46,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:46,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:46,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:46,381 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:46,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash 744912864, now seen corresponding path program 1 times [2023-11-24 21:58:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:46,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909678765] [2023-11-24 21:58:46,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:46,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:46,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:46,384 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:46,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-24 21:58:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:46,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-24 21:58:46,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:46,985 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1929~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1930~0#1.base_43| (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1929~0#1.base_47|) (_ bv0 1)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1929~0#1.base_47| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1930~0#1.base_43|)) (= (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1929~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1930~0#1.base_43| (_ bv0 1)) |c_#valid|))) is different from true [2023-11-24 21:58:46,987 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-24 21:58:46,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:46,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:46,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909678765] [2023-11-24 21:58:46,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909678765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:46,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:46,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:46,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102633836] [2023-11-24 21:58:46,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:46,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:46,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:46,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:46,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-24 21:58:46,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 64 [2023-11-24 21:58:46,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:46,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 64 [2023-11-24 21:58:46,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:47,184 INFO L124 PetriNetUnfolderBase]: 57/162 cut-off events. [2023-11-24 21:58:47,184 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-24 21:58:47,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 162 events. 57/162 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 534 event pairs, 48 based on Foata normal form. 4/159 useless extension candidates. Maximal degree in co-relation 318. Up to 102 conditions per place. [2023-11-24 21:58:47,193 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 20 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2023-11-24 21:58:47,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 148 flow [2023-11-24 21:58:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:58:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:58:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2023-11-24 21:58:47,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.284375 [2023-11-24 21:58:47,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 91 transitions. [2023-11-24 21:58:47,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 91 transitions. [2023-11-24 21:58:47,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:47,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 91 transitions. [2023-11-24 21:58:47,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,199 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,199 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 84 flow. Second operand 5 states and 91 transitions. [2023-11-24 21:58:47,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 148 flow [2023-11-24 21:58:47,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:47,202 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 104 flow [2023-11-24 21:58:47,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-11-24 21:58:47,203 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-11-24 21:58:47,203 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 104 flow [2023-11-24 21:58:47,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:47,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:47,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:47,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:47,408 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:47,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:47,408 INFO L85 PathProgramCache]: Analyzing trace with hash -859128236, now seen corresponding path program 1 times [2023-11-24 21:58:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:47,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823918818] [2023-11-24 21:58:47,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:47,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:47,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:47,411 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:47,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-24 21:58:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:47,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 21:58:47,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:58:47,684 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-24 21:58:47,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:58:47,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:58:47,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823918818] [2023-11-24 21:58:47,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823918818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:47,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:47,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:58:47,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875452904] [2023-11-24 21:58:47,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:47,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:58:47,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:58:47,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:58:47,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:58:47,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 64 [2023-11-24 21:58:47,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 104 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:47,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 64 [2023-11-24 21:58:47,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:47,933 INFO L124 PetriNetUnfolderBase]: 115/299 cut-off events. [2023-11-24 21:58:47,933 INFO L125 PetriNetUnfolderBase]: For 96/100 co-relation queries the response was YES. [2023-11-24 21:58:47,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 299 events. 115/299 cut-off events. For 96/100 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1249 event pairs, 39 based on Foata normal form. 4/294 useless extension candidates. Maximal degree in co-relation 697. Up to 95 conditions per place. [2023-11-24 21:58:47,936 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 37 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2023-11-24 21:58:47,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 264 flow [2023-11-24 21:58:47,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:58:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:58:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2023-11-24 21:58:47,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2023-11-24 21:58:47,939 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 148 transitions. [2023-11-24 21:58:47,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 148 transitions. [2023-11-24 21:58:47,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:47,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 148 transitions. [2023-11-24 21:58:47,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,943 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,944 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 104 flow. Second operand 6 states and 148 transitions. [2023-11-24 21:58:47,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 264 flow [2023-11-24 21:58:47,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 252 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:58:47,947 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 138 flow [2023-11-24 21:58:47,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-11-24 21:58:47,948 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2023-11-24 21:58:47,949 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 138 flow [2023-11-24 21:58:47,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:47,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:47,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:48,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:48,154 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-24 21:58:48,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:48,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1533891674, now seen corresponding path program 2 times [2023-11-24 21:58:48,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:58:48,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644006069] [2023-11-24 21:58:48,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 21:58:48,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:48,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:58:48,157 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 21:58:48,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-24 21:58:48,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 21:58:48,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-24 21:58:48,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:58:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:58:48,568 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 21:58:48,568 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:58:48,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (49 of 50 remaining) [2023-11-24 21:58:48,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2023-11-24 21:58:48,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2023-11-24 21:58:48,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2023-11-24 21:58:48,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2023-11-24 21:58:48,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 50 remaining) [2023-11-24 21:58:48,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2023-11-24 21:58:48,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2023-11-24 21:58:48,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2023-11-24 21:58:48,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2023-11-24 21:58:48,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2023-11-24 21:58:48,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2023-11-24 21:58:48,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2023-11-24 21:58:48,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2023-11-24 21:58:48,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2023-11-24 21:58:48,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2023-11-24 21:58:48,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2023-11-24 21:58:48,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2023-11-24 21:58:48,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2023-11-24 21:58:48,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2023-11-24 21:58:48,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2023-11-24 21:58:48,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2023-11-24 21:58:48,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2023-11-24 21:58:48,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2023-11-24 21:58:48,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2023-11-24 21:58:48,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2023-11-24 21:58:48,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2023-11-24 21:58:48,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 50 remaining) [2023-11-24 21:58:48,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2023-11-24 21:58:48,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (20 of 50 remaining) [2023-11-24 21:58:48,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2023-11-24 21:58:48,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2023-11-24 21:58:48,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2023-11-24 21:58:48,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2023-11-24 21:58:48,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2023-11-24 21:58:48,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2023-11-24 21:58:48,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2023-11-24 21:58:48,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2023-11-24 21:58:48,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 50 remaining) [2023-11-24 21:58:48,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2023-11-24 21:58:48,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2023-11-24 21:58:48,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2023-11-24 21:58:48,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2023-11-24 21:58:48,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2023-11-24 21:58:48,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2023-11-24 21:58:48,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2023-11-24 21:58:48,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2023-11-24 21:58:48,580 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2023-11-24 21:58:48,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2023-11-24 21:58:48,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 50 remaining) [2023-11-24 21:58:48,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-24 21:58:48,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 21:58:48,786 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:48,791 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:58:48,791 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:58:48,877 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-24 21:58:48,882 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated [2023-11-24 21:58:48,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:58:48 BasicIcfg [2023-11-24 21:58:48,925 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:58:48,925 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:58:48,925 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:58:48,926 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:58:48,926 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:36" (3/4) ... [2023-11-24 21:58:48,928 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:58:48,929 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:58:48,930 INFO L158 Benchmark]: Toolchain (without parser) took 14555.63ms. Allocated memory was 77.6MB in the beginning and 308.3MB in the end (delta: 230.7MB). Free memory was 52.5MB in the beginning and 158.6MB in the end (delta: -106.1MB). Peak memory consumption was 126.0MB. Max. memory is 16.1GB. [2023-11-24 21:58:48,930 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 77.6MB. Free memory was 53.3MB in the beginning and 53.1MB in the end (delta: 148.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:58:48,931 INFO L158 Benchmark]: CACSL2BoogieTranslator took 793.11ms. Allocated memory is still 77.6MB. Free memory was 52.3MB in the beginning and 47.0MB in the end (delta: 5.3MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2023-11-24 21:58:48,931 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.19ms. Allocated memory is still 77.6MB. Free memory was 47.0MB in the beginning and 44.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:58:48,931 INFO L158 Benchmark]: Boogie Preprocessor took 126.18ms. Allocated memory is still 77.6MB. Free memory was 44.3MB in the beginning and 40.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:58:48,932 INFO L158 Benchmark]: RCFGBuilder took 1562.73ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 40.7MB in the beginning and 64.6MB in the end (delta: -23.9MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2023-11-24 21:58:48,932 INFO L158 Benchmark]: TraceAbstraction took 11961.71ms. Allocated memory was 104.9MB in the beginning and 308.3MB in the end (delta: 203.4MB). Free memory was 64.1MB in the beginning and 158.6MB in the end (delta: -94.6MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2023-11-24 21:58:48,933 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 308.3MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:58:48,936 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.32ms. Allocated memory is still 77.6MB. Free memory was 53.3MB in the beginning and 53.1MB in the end (delta: 148.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 793.11ms. Allocated memory is still 77.6MB. Free memory was 52.3MB in the beginning and 47.0MB in the end (delta: 5.3MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.19ms. Allocated memory is still 77.6MB. Free memory was 47.0MB in the beginning and 44.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 126.18ms. Allocated memory is still 77.6MB. Free memory was 44.3MB in the beginning and 40.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1562.73ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 40.7MB in the beginning and 64.6MB in the end (delta: -23.9MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11961.71ms. Allocated memory was 104.9MB in the beginning and 308.3MB in the end (delta: 203.4MB). Free memory was 64.1MB in the beginning and 158.6MB in the end (delta: -94.6MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 308.3MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] 0 pthread_t t1930; [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929={7:0}, t1930={15:0}, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L772] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={7:0}, t1930={15:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={7:0}, t1930={15:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={7:0}, t1930={15:0}, weak$$choice1=2, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: -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: -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: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 815]: 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: 813]: 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 5 procedures, 97 locations, 50 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: 11.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 327 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 36 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 732 IncrementalHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 18 mSDtfsCounter, 732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=12, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 131 ConstructedInterpolants, 1 QuantifiedInterpolants, 1015 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1402 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-24 21:58:48,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42324694-afef-403d-98b2-cf30eb29ee19/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample