./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.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_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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_55e37e17-ba82-492b-8a92-018a6ff98072/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 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:58:36,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:58:36,416 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:58:36,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:58:36,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:58:36,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:58:36,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:58:36,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:58:36,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:58:36,453 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:58:36,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:58:36,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:58:36,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:58:36,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:58:36,457 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:58:36,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:58:36,458 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:58:36,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:58:36,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:58:36,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:58:36,461 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:58:36,462 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:58:36,462 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:58:36,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:58:36,463 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:58:36,464 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:58:36,465 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:58:36,465 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:58:36,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:58:36,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:58:36,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:58:36,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:58:36,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:58:36,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:58:36,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:58:36,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:58:36,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:58:36,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:58:36,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:58:36,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:58:36,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:58:36,487 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_55e37e17-ba82-492b-8a92-018a6ff98072/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_55e37e17-ba82-492b-8a92-018a6ff98072/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 -> 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e [2023-11-24 21:58:36,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:58:36,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:58:36,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:58:36,825 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:58:36,828 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:58:36,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2023-11-24 21:58:40,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:58:40,445 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:58:40,446 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2023-11-24 21:58:40,462 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/data/fa32dc3f3/8f72c682d74043859c58b44eb523241f/FLAG25f08aede [2023-11-24 21:58:40,481 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/data/fa32dc3f3/8f72c682d74043859c58b44eb523241f [2023-11-24 21:58:40,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:58:40,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:58:40,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:58:40,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:58:40,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:58:40,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:58:40" (1/1) ... [2023-11-24 21:58:40,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e1b4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:40, skipping insertion in model container [2023-11-24 21:58:40,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:58:40" (1/1) ... [2023-11-24 21:58:40,543 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:58:41,005 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:58:41,019 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:58:41,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:58:41,166 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:58:41,167 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:58:41,174 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:58:41,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:41 WrapperNode [2023-11-24 21:58:41,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:58:41,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:58:41,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:58:41,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:58:41,186 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:41" (1/1) ... [2023-11-24 21:58:41,224 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:41" (1/1) ... [2023-11-24 21:58:41,262 INFO L138 Inliner]: procedures = 176, calls = 68, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-11-24 21:58:41,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:58:41,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:58:41,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:58:41,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:58:41,277 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:41" (1/1) ... [2023-11-24 21:58:41,277 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:41" (1/1) ... [2023-11-24 21:58:41,282 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:41" (1/1) ... [2023-11-24 21:58:41,310 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 1, 1, 13, 1]. 72 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 1, 0]. The 8 writes are split as follows [0, 1, 1, 5, 1]. [2023-11-24 21:58:41,310 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:41" (1/1) ... [2023-11-24 21:58:41,311 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:41" (1/1) ... [2023-11-24 21:58:41,335 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:41" (1/1) ... [2023-11-24 21:58:41,343 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:41" (1/1) ... [2023-11-24 21:58:41,346 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:41" (1/1) ... [2023-11-24 21:58:41,351 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:41" (1/1) ... [2023-11-24 21:58:41,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:58:41,368 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:58:41,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:58:41,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:58:41,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:41" (1/1) ... [2023-11-24 21:58:41,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:58:41,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:58:41,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:41,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 21:58:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 21:58:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-24 21:58:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-24 21:58:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-24 21:58:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:58:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:58:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:58:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:58:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-24 21:58:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:58:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:58:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:58:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:58:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:58:41,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:58:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:58:41,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:58:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:58:41,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:58:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:58:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:58:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:58:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:58:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-24 21:58:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:58:41,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:58:41,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:58:41,515 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:41,787 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:58:41,791 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:58:42,502 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:58:43,357 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:58:43,357 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:58:43,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:43 BoogieIcfgContainer [2023-11-24 21:58:43,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:58:43,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:58:43,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:58:43,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:58:43,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:58:40" (1/3) ... [2023-11-24 21:58:43,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d111536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:58:43, skipping insertion in model container [2023-11-24 21:58:43,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:58:41" (2/3) ... [2023-11-24 21:58:43,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d111536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:58:43, skipping insertion in model container [2023-11-24 21:58:43,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:58:43" (3/3) ... [2023-11-24 21:58:43,371 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_rmo.oepc.i [2023-11-24 21:58:43,396 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:58:43,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-24 21:58:43,396 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:58:43,513 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:58:43,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 76 transitions, 164 flow [2023-11-24 21:58:43,635 INFO L124 PetriNetUnfolderBase]: 2/73 cut-off events. [2023-11-24 21:58:43,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:58:43,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 230 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-11-24 21:58:43,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 76 transitions, 164 flow [2023-11-24 21:58:43,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 73 transitions, 155 flow [2023-11-24 21:58:43,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:58:43,680 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;@741e0859, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:58:43,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-24 21:58:43,684 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:58:43,684 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:58:43,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:58:43,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:43,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:58:43,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:43,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash 19657, now seen corresponding path program 1 times [2023-11-24 21:58:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:43,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774166133] [2023-11-24 21:58:43,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:44,097 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,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:44,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774166133] [2023-11-24 21:58:44,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774166133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:44,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:44,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:44,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112533794] [2023-11-24 21:58:44,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:44,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:44,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:44,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:44,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:44,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 76 [2023-11-24 21:58:44,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:44,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 76 [2023-11-24 21:58:44,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:45,951 INFO L124 PetriNetUnfolderBase]: 3235/5382 cut-off events. [2023-11-24 21:58:45,952 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-24 21:58:45,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10186 conditions, 5382 events. 3235/5382 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 42912 event pairs, 2795 based on Foata normal form. 200/3382 useless extension candidates. Maximal degree in co-relation 10172. Up to 4127 conditions per place. [2023-11-24 21:58:46,030 INFO L140 encePairwiseOnDemand]: 61/76 looper letters, 47 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-11-24 21:58:46,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 73 transitions, 253 flow [2023-11-24 21:58:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2023-11-24 21:58:46,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6710526315789473 [2023-11-24 21:58:46,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 153 transitions. [2023-11-24 21:58:46,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 153 transitions. [2023-11-24 21:58:46,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:46,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 153 transitions. [2023-11-24 21:58:46,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:46,066 INFO L175 Difference]: Start difference. First operand has 81 places, 73 transitions, 155 flow. Second operand 3 states and 153 transitions. [2023-11-24 21:58:46,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 73 transitions, 253 flow [2023-11-24 21:58:46,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 250 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:58:46,076 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 128 flow [2023-11-24 21:58:46,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2023-11-24 21:58:46,083 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -13 predicate places. [2023-11-24 21:58:46,084 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 128 flow [2023-11-24 21:58:46,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:46,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:58:46,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:58:46,085 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:46,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 19658, now seen corresponding path program 1 times [2023-11-24 21:58:46,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:46,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935050540] [2023-11-24 21:58:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:46,237 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,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:46,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935050540] [2023-11-24 21:58:46,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935050540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:46,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:46,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:46,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542171697] [2023-11-24 21:58:46,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:46,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:46,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:46,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:46,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:46,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 76 [2023-11-24 21:58:46,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:46,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 76 [2023-11-24 21:58:46,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:47,669 INFO L124 PetriNetUnfolderBase]: 3235/5381 cut-off events. [2023-11-24 21:58:47,670 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-11-24 21:58:47,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10283 conditions, 5381 events. 3235/5381 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 42973 event pairs, 2795 based on Foata normal form. 1/3182 useless extension candidates. Maximal degree in co-relation 10272. Up to 4126 conditions per place. [2023-11-24 21:58:47,753 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 46 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-24 21:58:47,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 250 flow [2023-11-24 21:58:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2023-11-24 21:58:47,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-11-24 21:58:47,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 133 transitions. [2023-11-24 21:58:47,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 133 transitions. [2023-11-24 21:58:47,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:47,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 133 transitions. [2023-11-24 21:58:47,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:47,763 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 128 flow. Second operand 3 states and 133 transitions. [2023-11-24 21:58:47,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 250 flow [2023-11-24 21:58:47,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:47,777 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 126 flow [2023-11-24 21:58:47,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-11-24 21:58:47,779 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -14 predicate places. [2023-11-24 21:58:47,779 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 126 flow [2023-11-24 21:58:47,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:47,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:47,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:58:47,781 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:47,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:47,782 INFO L85 PathProgramCache]: Analyzing trace with hash 586235350, now seen corresponding path program 1 times [2023-11-24 21:58:47,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:47,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940439673] [2023-11-24 21:58:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:47,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:47,887 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,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:47,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940439673] [2023-11-24 21:58:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940439673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:47,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:47,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817016582] [2023-11-24 21:58:47,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:47,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:47,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:47,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 76 [2023-11-24 21:58:47,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:47,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 76 [2023-11-24 21:58:47,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:49,138 INFO L124 PetriNetUnfolderBase]: 3239/5362 cut-off events. [2023-11-24 21:58:49,138 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-11-24 21:58:49,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10273 conditions, 5362 events. 3239/5362 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 42659 event pairs, 2815 based on Foata normal form. 0/3171 useless extension candidates. Maximal degree in co-relation 10262. Up to 4129 conditions per place. [2023-11-24 21:58:49,183 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 47 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-11-24 21:58:49,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 250 flow [2023-11-24 21:58:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:49,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2023-11-24 21:58:49,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5745614035087719 [2023-11-24 21:58:49,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 131 transitions. [2023-11-24 21:58:49,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 131 transitions. [2023-11-24 21:58:49,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:49,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 131 transitions. [2023-11-24 21:58:49,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 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:49,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:49,190 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:49,190 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 126 flow. Second operand 3 states and 131 transitions. [2023-11-24 21:58:49,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 250 flow [2023-11-24 21:58:49,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:49,200 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 124 flow [2023-11-24 21:58:49,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-11-24 21:58:49,202 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -15 predicate places. [2023-11-24 21:58:49,202 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 124 flow [2023-11-24 21:58:49,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:49,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:49,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:49,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:58:49,203 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:49,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:49,204 INFO L85 PathProgramCache]: Analyzing trace with hash 586235351, now seen corresponding path program 1 times [2023-11-24 21:58:49,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:49,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530266492] [2023-11-24 21:58:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:49,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:49,368 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:49,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:49,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530266492] [2023-11-24 21:58:49,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530266492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:49,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:49,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317423157] [2023-11-24 21:58:49,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:49,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:49,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:49,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:49,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:49,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 76 [2023-11-24 21:58:49,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:49,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:49,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 76 [2023-11-24 21:58:49,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:50,608 INFO L124 PetriNetUnfolderBase]: 3235/5336 cut-off events. [2023-11-24 21:58:50,609 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2023-11-24 21:58:50,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10242 conditions, 5336 events. 3235/5336 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 43894 event pairs, 2811 based on Foata normal form. 5/3155 useless extension candidates. Maximal degree in co-relation 10232. Up to 4120 conditions per place. [2023-11-24 21:58:50,660 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 46 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-24 21:58:50,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 70 transitions, 246 flow [2023-11-24 21:58:50,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2023-11-24 21:58:50,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-11-24 21:58:50,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 133 transitions. [2023-11-24 21:58:50,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 133 transitions. [2023-11-24 21:58:50,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:50,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 133 transitions. [2023-11-24 21:58:50,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:50,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:50,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:50,669 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 124 flow. Second operand 3 states and 133 transitions. [2023-11-24 21:58:50,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 70 transitions, 246 flow [2023-11-24 21:58:50,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 70 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:50,679 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 122 flow [2023-11-24 21:58:50,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2023-11-24 21:58:50,681 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -16 predicate places. [2023-11-24 21:58:50,681 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 122 flow [2023-11-24 21:58:50,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:50,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:50,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:50,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:58:50,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:50,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash 586236952, now seen corresponding path program 1 times [2023-11-24 21:58:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:50,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511405426] [2023-11-24 21:58:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:50,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:50,814 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:50,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:50,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511405426] [2023-11-24 21:58:50,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511405426] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:50,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:50,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:50,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208959820] [2023-11-24 21:58:50,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:50,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:58:50,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:50,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:58:50,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:58:50,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 76 [2023-11-24 21:58:50,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:50,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:50,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 76 [2023-11-24 21:58:50,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:51,816 INFO L124 PetriNetUnfolderBase]: 1841/3267 cut-off events. [2023-11-24 21:58:51,816 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-11-24 21:58:51,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6179 conditions, 3267 events. 1841/3267 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 25788 event pairs, 1325 based on Foata normal form. 0/2289 useless extension candidates. Maximal degree in co-relation 6168. Up to 1911 conditions per place. [2023-11-24 21:58:51,850 INFO L140 encePairwiseOnDemand]: 65/76 looper letters, 49 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2023-11-24 21:58:51,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 75 transitions, 268 flow [2023-11-24 21:58:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-11-24 21:58:51,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2023-11-24 21:58:51,853 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 176 transitions. [2023-11-24 21:58:51,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 176 transitions. [2023-11-24 21:58:51,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:51,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 176 transitions. [2023-11-24 21:58:51,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 0 states have call successors, (0), 0 states 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:51,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:51,859 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:51,860 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 122 flow. Second operand 4 states and 176 transitions. [2023-11-24 21:58:51,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 75 transitions, 268 flow [2023-11-24 21:58:51,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:51,866 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 162 flow [2023-11-24 21:58:51,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-11-24 21:58:51,871 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -14 predicate places. [2023-11-24 21:58:51,871 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 162 flow [2023-11-24 21:58:51,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:51,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:51,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:58:51,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:58:51,873 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:51,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:51,875 INFO L85 PathProgramCache]: Analyzing trace with hash 586236953, now seen corresponding path program 1 times [2023-11-24 21:58:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:51,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810677246] [2023-11-24 21:58:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:52,094 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:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810677246] [2023-11-24 21:58:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810677246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:52,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:52,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:52,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018950021] [2023-11-24 21:58:52,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:52,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:58:52,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:52,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:58:52,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:58:52,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 76 [2023-11-24 21:58:52,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:52,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:52,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 76 [2023-11-24 21:58:52,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:52,510 INFO L124 PetriNetUnfolderBase]: 693/1369 cut-off events. [2023-11-24 21:58:52,510 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2023-11-24 21:58:52,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3058 conditions, 1369 events. 693/1369 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 10116 event pairs, 493 based on Foata normal form. 275/1532 useless extension candidates. Maximal degree in co-relation 3044. Up to 644 conditions per place. [2023-11-24 21:58:52,520 INFO L140 encePairwiseOnDemand]: 68/76 looper letters, 33 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-11-24 21:58:52,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 238 flow [2023-11-24 21:58:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-11-24 21:58:52,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197368421052632 [2023-11-24 21:58:52,523 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 158 transitions. [2023-11-24 21:58:52,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 158 transitions. [2023-11-24 21:58:52,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:52,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 158 transitions. [2023-11-24 21:58:52,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:52,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:52,527 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:52,527 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 162 flow. Second operand 4 states and 158 transitions. [2023-11-24 21:58:52,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 238 flow [2023-11-24 21:58:52,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 21:58:52,531 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 152 flow [2023-11-24 21:58:52,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-24 21:58:52,533 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -18 predicate places. [2023-11-24 21:58:52,533 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 152 flow [2023-11-24 21:58:52,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:52,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:52,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:52,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:58:52,534 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:52,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:52,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1200919238, now seen corresponding path program 1 times [2023-11-24 21:58:52,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:52,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651554956] [2023-11-24 21:58:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:52,596 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:52,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:52,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651554956] [2023-11-24 21:58:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651554956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:52,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:52,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:52,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750254026] [2023-11-24 21:58:52,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:52,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:52,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:52,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:52,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:52,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 76 [2023-11-24 21:58:52,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:52,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:52,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 76 [2023-11-24 21:58:52,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:52,942 INFO L124 PetriNetUnfolderBase]: 700/1367 cut-off events. [2023-11-24 21:58:52,943 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2023-11-24 21:58:52,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 1367 events. 700/1367 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 10113 event pairs, 397 based on Foata normal form. 0/1267 useless extension candidates. Maximal degree in co-relation 3081. Up to 638 conditions per place. [2023-11-24 21:58:52,954 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 34 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-24 21:58:52,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 240 flow [2023-11-24 21:58:52,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-24 21:58:52,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043859649122807 [2023-11-24 21:58:52,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-24 21:58:52,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-24 21:58:52,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:52,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-24 21:58:52,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:52,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:52,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:52,969 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 152 flow. Second operand 3 states and 115 transitions. [2023-11-24 21:58:52,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 240 flow [2023-11-24 21:58:52,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:52,974 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 151 flow [2023-11-24 21:58:52,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-24 21:58:52,976 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -19 predicate places. [2023-11-24 21:58:52,977 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 151 flow [2023-11-24 21:58:52,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:52,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:52,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:52,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:58:52,978 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:52,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1200919239, now seen corresponding path program 1 times [2023-11-24 21:58:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:52,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149915476] [2023-11-24 21:58:52,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:52,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:53,093 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:53,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:53,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149915476] [2023-11-24 21:58:53,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149915476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:53,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:53,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:58:53,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963012980] [2023-11-24 21:58:53,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:53,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:53,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:53,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:53,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:53,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 76 [2023-11-24 21:58:53,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:53,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:53,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 76 [2023-11-24 21:58:53,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:53,464 INFO L124 PetriNetUnfolderBase]: 693/1354 cut-off events. [2023-11-24 21:58:53,464 INFO L125 PetriNetUnfolderBase]: For 463/463 co-relation queries the response was YES. [2023-11-24 21:58:53,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 1354 events. 693/1354 cut-off events. For 463/463 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 9983 event pairs, 394 based on Foata normal form. 6/1263 useless extension candidates. Maximal degree in co-relation 3083. Up to 625 conditions per place. [2023-11-24 21:58:53,476 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 33 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-24 21:58:53,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 237 flow [2023-11-24 21:58:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-24 21:58:53,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2023-11-24 21:58:53,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-24 21:58:53,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-24 21:58:53,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:53,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-24 21:58:53,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:53,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:53,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:53,481 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 151 flow. Second operand 3 states and 117 transitions. [2023-11-24 21:58:53,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 237 flow [2023-11-24 21:58:53,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 233 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:53,488 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 149 flow [2023-11-24 21:58:53,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-11-24 21:58:53,491 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -20 predicate places. [2023-11-24 21:58:53,491 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 149 flow [2023-11-24 21:58:53,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:53,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:53,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:53,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:58:53,492 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:53,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:53,493 INFO L85 PathProgramCache]: Analyzing trace with hash -395493795, now seen corresponding path program 1 times [2023-11-24 21:58:53,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:53,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647145949] [2023-11-24 21:58:53,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:53,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:53,665 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:53,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:53,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647145949] [2023-11-24 21:58:53,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647145949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:53,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:53,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:58:53,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879717332] [2023-11-24 21:58:53,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:53,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:58:53,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:53,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:58:53,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:58:53,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 76 [2023-11-24 21:58:53,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:53,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:53,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 76 [2023-11-24 21:58:53,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:54,014 INFO L124 PetriNetUnfolderBase]: 657/1420 cut-off events. [2023-11-24 21:58:54,014 INFO L125 PetriNetUnfolderBase]: For 403/409 co-relation queries the response was YES. [2023-11-24 21:58:54,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3087 conditions, 1420 events. 657/1420 cut-off events. For 403/409 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 11004 event pairs, 213 based on Foata normal form. 0/1338 useless extension candidates. Maximal degree in co-relation 3073. Up to 761 conditions per place. [2023-11-24 21:58:54,025 INFO L140 encePairwiseOnDemand]: 72/76 looper letters, 47 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-11-24 21:58:54,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 327 flow [2023-11-24 21:58:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:58:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:58:54,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-24 21:58:54,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5877192982456141 [2023-11-24 21:58:54,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-24 21:58:54,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-24 21:58:54,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:54,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-24 21:58:54,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states 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:54,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:54,031 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:58:54,031 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 149 flow. Second operand 3 states and 134 transitions. [2023-11-24 21:58:54,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 327 flow [2023-11-24 21:58:54,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 70 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:54,035 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 158 flow [2023-11-24 21:58:54,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-11-24 21:58:54,036 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -19 predicate places. [2023-11-24 21:58:54,037 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 158 flow [2023-11-24 21:58:54,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states 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:54,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:54,037 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:54,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:58:54,038 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:54,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:54,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2112334800, now seen corresponding path program 1 times [2023-11-24 21:58:54,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:54,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650585801] [2023-11-24 21:58:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:54,160 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:54,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:54,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650585801] [2023-11-24 21:58:54,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650585801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:54,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:54,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401708272] [2023-11-24 21:58:54,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:54,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:58:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:58:54,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:58:54,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 76 [2023-11-24 21:58:54,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:54,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:54,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 76 [2023-11-24 21:58:54,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:54,593 INFO L124 PetriNetUnfolderBase]: 657/1269 cut-off events. [2023-11-24 21:58:54,593 INFO L125 PetriNetUnfolderBase]: For 564/567 co-relation queries the response was YES. [2023-11-24 21:58:54,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3136 conditions, 1269 events. 657/1269 cut-off events. For 564/567 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 8818 event pairs, 256 based on Foata normal form. 0/1242 useless extension candidates. Maximal degree in co-relation 3120. Up to 568 conditions per place. [2023-11-24 21:58:54,603 INFO L140 encePairwiseOnDemand]: 70/76 looper letters, 42 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2023-11-24 21:58:54,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 69 transitions, 306 flow [2023-11-24 21:58:54,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2023-11-24 21:58:54,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460526315789473 [2023-11-24 21:58:54,606 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 166 transitions. [2023-11-24 21:58:54,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 166 transitions. [2023-11-24 21:58:54,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:54,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 166 transitions. [2023-11-24 21:58:54,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:54,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:54,609 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:54,610 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 158 flow. Second operand 4 states and 166 transitions. [2023-11-24 21:58:54,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 69 transitions, 306 flow [2023-11-24 21:58:54,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 69 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:54,613 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 168 flow [2023-11-24 21:58:54,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-11-24 21:58:54,614 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -19 predicate places. [2023-11-24 21:58:54,615 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 168 flow [2023-11-24 21:58:54,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:54,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:54,616 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:54,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:58:54,616 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:54,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash -580015811, now seen corresponding path program 1 times [2023-11-24 21:58:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227187668] [2023-11-24 21:58:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:54,864 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:54,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:54,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227187668] [2023-11-24 21:58:54,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227187668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:54,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:54,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:54,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250910029] [2023-11-24 21:58:54,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:54,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:58:54,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:54,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:58:54,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:58:54,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 76 [2023-11-24 21:58:54,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:54,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:54,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 76 [2023-11-24 21:58:54,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:55,276 INFO L124 PetriNetUnfolderBase]: 629/1225 cut-off events. [2023-11-24 21:58:55,276 INFO L125 PetriNetUnfolderBase]: For 628/631 co-relation queries the response was YES. [2023-11-24 21:58:55,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 1225 events. 629/1225 cut-off events. For 628/631 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 8426 event pairs, 376 based on Foata normal form. 16/1214 useless extension candidates. Maximal degree in co-relation 3064. Up to 724 conditions per place. [2023-11-24 21:58:55,287 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 45 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2023-11-24 21:58:55,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 332 flow [2023-11-24 21:58:55,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2023-11-24 21:58:55,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2023-11-24 21:58:55,289 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 160 transitions. [2023-11-24 21:58:55,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 160 transitions. [2023-11-24 21:58:55,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:55,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 160 transitions. [2023-11-24 21:58:55,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 40.0) internal successors, (160), 4 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:55,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:55,293 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:55,293 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 168 flow. Second operand 4 states and 160 transitions. [2023-11-24 21:58:55,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 332 flow [2023-11-24 21:58:55,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:55,297 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 161 flow [2023-11-24 21:58:55,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-11-24 21:58:55,298 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -19 predicate places. [2023-11-24 21:58:55,299 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 161 flow [2023-11-24 21:58:55,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:55,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:55,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:55,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:58:55,300 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:55,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:55,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1508588504, now seen corresponding path program 1 times [2023-11-24 21:58:55,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:55,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555751439] [2023-11-24 21:58:55,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:55,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:56,298 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:56,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:56,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555751439] [2023-11-24 21:58:56,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555751439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:56,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:56,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:58:56,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831409792] [2023-11-24 21:58:56,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:56,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:58:56,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:56,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:58:56,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:58:56,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 76 [2023-11-24 21:58:56,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 161 flow. Second operand has 9 states, 9 states have (on average 25.666666666666668) internal successors, (231), 9 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:56,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:56,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 76 [2023-11-24 21:58:56,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:57,137 INFO L124 PetriNetUnfolderBase]: 975/1875 cut-off events. [2023-11-24 21:58:57,137 INFO L125 PetriNetUnfolderBase]: For 954/957 co-relation queries the response was YES. [2023-11-24 21:58:57,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 1875 events. 975/1875 cut-off events. For 954/957 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 14408 event pairs, 501 based on Foata normal form. 0/1798 useless extension candidates. Maximal degree in co-relation 4454. Up to 568 conditions per place. [2023-11-24 21:58:57,150 INFO L140 encePairwiseOnDemand]: 69/76 looper letters, 63 selfloop transitions, 9 changer transitions 2/91 dead transitions. [2023-11-24 21:58:57,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 458 flow [2023-11-24 21:58:57,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:58:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:58:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2023-11-24 21:58:57,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2023-11-24 21:58:57,153 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 238 transitions. [2023-11-24 21:58:57,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 238 transitions. [2023-11-24 21:58:57,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:57,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 238 transitions. [2023-11-24 21:58:57,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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:57,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 states 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:57,157 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 states 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:57,157 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 161 flow. Second operand 7 states and 238 transitions. [2023-11-24 21:58:57,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 458 flow [2023-11-24 21:58:57,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 91 transitions, 451 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:58:57,161 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 227 flow [2023-11-24 21:58:57,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=227, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2023-11-24 21:58:57,162 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -10 predicate places. [2023-11-24 21:58:57,163 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 227 flow [2023-11-24 21:58:57,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.666666666666668) internal successors, (231), 9 states have internal predecessors, (231), 0 states have call successors, (0), 0 states 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:57,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:57,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:57,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:58:57,164 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:57,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:57,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1508587374, now seen corresponding path program 1 times [2023-11-24 21:58:57,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:57,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614535630] [2023-11-24 21:58:57,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:57,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:57,433 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:57,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:57,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614535630] [2023-11-24 21:58:57,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614535630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:57,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:57,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:58:57,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699355308] [2023-11-24 21:58:57,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:57,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:58:57,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:58:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:58:57,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 76 [2023-11-24 21:58:57,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:57,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:57,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 76 [2023-11-24 21:58:57,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:58:58,248 INFO L124 PetriNetUnfolderBase]: 2656/4522 cut-off events. [2023-11-24 21:58:58,250 INFO L125 PetriNetUnfolderBase]: For 3082/3144 co-relation queries the response was YES. [2023-11-24 21:58:58,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11074 conditions, 4522 events. 2656/4522 cut-off events. For 3082/3144 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 31847 event pairs, 328 based on Foata normal form. 105/4580 useless extension candidates. Maximal degree in co-relation 11053. Up to 3200 conditions per place. [2023-11-24 21:58:58,284 INFO L140 encePairwiseOnDemand]: 70/76 looper letters, 55 selfloop transitions, 5 changer transitions 1/77 dead transitions. [2023-11-24 21:58:58,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 439 flow [2023-11-24 21:58:58,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:58:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:58:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-11-24 21:58:58,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967105263157895 [2023-11-24 21:58:58,287 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 151 transitions. [2023-11-24 21:58:58,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 151 transitions. [2023-11-24 21:58:58,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:58:58,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 151 transitions. [2023-11-24 21:58:58,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:58,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:58,291 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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:58,291 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 227 flow. Second operand 4 states and 151 transitions. [2023-11-24 21:58:58,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 439 flow [2023-11-24 21:58:58,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 77 transitions, 423 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-24 21:58:58,310 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 250 flow [2023-11-24 21:58:58,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2023-11-24 21:58:58,312 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -6 predicate places. [2023-11-24 21:58:58,312 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 250 flow [2023-11-24 21:58:58,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:58,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:58:58,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:58:58,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:58:58,313 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:58:58,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:58:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1878761364, now seen corresponding path program 1 times [2023-11-24 21:58:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:58:58,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049979467] [2023-11-24 21:58:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:58:58,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:58:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:58:59,157 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:59,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:58:59,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049979467] [2023-11-24 21:58:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049979467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:58:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:58:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:58:59,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446846780] [2023-11-24 21:58:59,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:58:59,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:58:59,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:58:59,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:58:59,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:58:59,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 76 [2023-11-24 21:58:59,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 250 flow. Second operand has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 0 states have call successors, (0), 0 states 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:59,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:58:59,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 76 [2023-11-24 21:58:59,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:00,433 INFO L124 PetriNetUnfolderBase]: 1843/3351 cut-off events. [2023-11-24 21:59:00,433 INFO L125 PetriNetUnfolderBase]: For 2053/2090 co-relation queries the response was YES. [2023-11-24 21:59:00,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8734 conditions, 3351 events. 1843/3351 cut-off events. For 2053/2090 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 24106 event pairs, 315 based on Foata normal form. 90/3232 useless extension candidates. Maximal degree in co-relation 8709. Up to 1435 conditions per place. [2023-11-24 21:59:00,467 INFO L140 encePairwiseOnDemand]: 70/76 looper letters, 45 selfloop transitions, 12 changer transitions 1/77 dead transitions. [2023-11-24 21:59:00,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 77 transitions, 442 flow [2023-11-24 21:59:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:59:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:59:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2023-11-24 21:59:00,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42293233082706766 [2023-11-24 21:59:00,470 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 225 transitions. [2023-11-24 21:59:00,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 225 transitions. [2023-11-24 21:59:00,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:00,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 225 transitions. [2023-11-24 21:59:00,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.142857142857146) internal successors, (225), 7 states have internal predecessors, (225), 0 states have call successors, (0), 0 states 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:59:00,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 states 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:59:00,475 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 76.0) internal successors, (608), 8 states have internal predecessors, (608), 0 states have call successors, (0), 0 states 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:59:00,475 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 250 flow. Second operand 7 states and 225 transitions. [2023-11-24 21:59:00,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 77 transitions, 442 flow [2023-11-24 21:59:00,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 77 transitions, 427 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-24 21:59:00,490 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 296 flow [2023-11-24 21:59:00,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2023-11-24 21:59:00,492 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2023-11-24 21:59:00,492 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 296 flow [2023-11-24 21:59:00,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.77777777777778) internal successors, (241), 9 states have internal predecessors, (241), 0 states have call successors, (0), 0 states 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:59:00,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:00,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:00,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:59:00,493 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:59:00,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:00,494 INFO L85 PathProgramCache]: Analyzing trace with hash 633624786, now seen corresponding path program 1 times [2023-11-24 21:59:00,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:00,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820487148] [2023-11-24 21:59:00,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:00,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:00,813 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:59:00,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:00,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820487148] [2023-11-24 21:59:00,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820487148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:00,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:00,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:59:00,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25457521] [2023-11-24 21:59:00,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:00,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:59:00,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:00,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:59:00,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:59:00,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 76 [2023-11-24 21:59:00,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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:59:00,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:00,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 76 [2023-11-24 21:59:00,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:01,490 INFO L124 PetriNetUnfolderBase]: 1612/2761 cut-off events. [2023-11-24 21:59:01,490 INFO L125 PetriNetUnfolderBase]: For 1997/2002 co-relation queries the response was YES. [2023-11-24 21:59:01,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7250 conditions, 2761 events. 1612/2761 cut-off events. For 1997/2002 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16647 event pairs, 99 based on Foata normal form. 96/2832 useless extension candidates. Maximal degree in co-relation 7226. Up to 1637 conditions per place. [2023-11-24 21:59:01,513 INFO L140 encePairwiseOnDemand]: 70/76 looper letters, 63 selfloop transitions, 8 changer transitions 4/91 dead transitions. [2023-11-24 21:59:01,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 91 transitions, 577 flow [2023-11-24 21:59:01,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:59:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:59:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2023-11-24 21:59:01,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2023-11-24 21:59:01,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 188 transitions. [2023-11-24 21:59:01,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 188 transitions. [2023-11-24 21:59:01,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:01,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 188 transitions. [2023-11-24 21:59:01,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states 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:59:01,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:01,521 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 76.0) internal successors, (456), 6 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:01,522 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 296 flow. Second operand 5 states and 188 transitions. [2023-11-24 21:59:01,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 91 transitions, 577 flow [2023-11-24 21:59:01,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 91 transitions, 560 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-24 21:59:01,529 INFO L231 Difference]: Finished difference. Result has 81 places, 59 transitions, 301 flow [2023-11-24 21:59:01,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=81, PETRI_TRANSITIONS=59} [2023-11-24 21:59:01,531 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 0 predicate places. [2023-11-24 21:59:01,531 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 59 transitions, 301 flow [2023-11-24 21:59:01,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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:59:01,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:01,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:01,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:59:01,532 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:59:01,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1442147852, now seen corresponding path program 1 times [2023-11-24 21:59:01,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:01,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404548251] [2023-11-24 21:59:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:01,854 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:59:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:01,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404548251] [2023-11-24 21:59:01,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404548251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:01,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:01,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:59:01,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357956999] [2023-11-24 21:59:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:01,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:59:01,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:01,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:59:01,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:59:01,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 76 [2023-11-24 21:59:01,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 59 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:59:01,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:01,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 76 [2023-11-24 21:59:01,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:02,235 INFO L124 PetriNetUnfolderBase]: 690/1195 cut-off events. [2023-11-24 21:59:02,235 INFO L125 PetriNetUnfolderBase]: For 1522/1527 co-relation queries the response was YES. [2023-11-24 21:59:02,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 1195 events. 690/1195 cut-off events. For 1522/1527 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5802 event pairs, 35 based on Foata normal form. 60/1242 useless extension candidates. Maximal degree in co-relation 3540. Up to 404 conditions per place. [2023-11-24 21:59:02,245 INFO L140 encePairwiseOnDemand]: 70/76 looper letters, 47 selfloop transitions, 11 changer transitions 5/78 dead transitions. [2023-11-24 21:59:02,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 475 flow [2023-11-24 21:59:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:59:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:59:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2023-11-24 21:59:02,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45394736842105265 [2023-11-24 21:59:02,248 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 207 transitions. [2023-11-24 21:59:02,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 207 transitions. [2023-11-24 21:59:02,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:02,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 207 transitions. [2023-11-24 21:59:02,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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:59:02,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:02,252 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:02,252 INFO L175 Difference]: Start difference. First operand has 81 places, 59 transitions, 301 flow. Second operand 6 states and 207 transitions. [2023-11-24 21:59:02,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 475 flow [2023-11-24 21:59:02,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 421 flow, removed 4 selfloop flow, removed 10 redundant places. [2023-11-24 21:59:02,260 INFO L231 Difference]: Finished difference. Result has 73 places, 47 transitions, 212 flow [2023-11-24 21:59:02,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=73, PETRI_TRANSITIONS=47} [2023-11-24 21:59:02,261 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -8 predicate places. [2023-11-24 21:59:02,261 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 47 transitions, 212 flow [2023-11-24 21:59:02,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:59:02,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:02,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:02,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:59:02,263 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:59:02,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:02,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1308273046, now seen corresponding path program 1 times [2023-11-24 21:59:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:02,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706561504] [2023-11-24 21:59:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:02,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:02,665 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:59:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:02,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706561504] [2023-11-24 21:59:02,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706561504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:02,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:02,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:59:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642050374] [2023-11-24 21:59:02,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:02,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:59:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:02,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:59:02,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:59:02,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 76 [2023-11-24 21:59:02,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 47 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:59:02,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:02,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 76 [2023-11-24 21:59:02,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:03,053 INFO L124 PetriNetUnfolderBase]: 761/1549 cut-off events. [2023-11-24 21:59:03,053 INFO L125 PetriNetUnfolderBase]: For 1255/1285 co-relation queries the response was YES. [2023-11-24 21:59:03,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3963 conditions, 1549 events. 761/1549 cut-off events. For 1255/1285 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9354 event pairs, 141 based on Foata normal form. 16/1508 useless extension candidates. Maximal degree in co-relation 3951. Up to 482 conditions per place. [2023-11-24 21:59:03,065 INFO L140 encePairwiseOnDemand]: 70/76 looper letters, 32 selfloop transitions, 3 changer transitions 17/75 dead transitions. [2023-11-24 21:59:03,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 412 flow [2023-11-24 21:59:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:59:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:59:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2023-11-24 21:59:03,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-11-24 21:59:03,067 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 209 transitions. [2023-11-24 21:59:03,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 209 transitions. [2023-11-24 21:59:03,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:03,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 209 transitions. [2023-11-24 21:59:03,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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:59:03,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:03,071 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 76.0) internal successors, (532), 7 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:03,071 INFO L175 Difference]: Start difference. First operand has 73 places, 47 transitions, 212 flow. Second operand 6 states and 209 transitions. [2023-11-24 21:59:03,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 412 flow [2023-11-24 21:59:03,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 337 flow, removed 14 selfloop flow, removed 11 redundant places. [2023-11-24 21:59:03,083 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 163 flow [2023-11-24 21:59:03,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2023-11-24 21:59:03,084 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -16 predicate places. [2023-11-24 21:59:03,084 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 163 flow [2023-11-24 21:59:03,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:59:03,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:03,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:03,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:59:03,085 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:59:03,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:03,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1228912934, now seen corresponding path program 2 times [2023-11-24 21:59:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:03,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108379840] [2023-11-24 21:59:03,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:03,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:59:03,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 21:59:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 21:59:03,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-24 21:59:03,244 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 21:59:03,245 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-11-24 21:59:03,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-11-24 21:59:03,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-11-24 21:59:03,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-11-24 21:59:03,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-11-24 21:59:03,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-11-24 21:59:03,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-11-24 21:59:03,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-11-24 21:59:03,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-11-24 21:59:03,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-11-24 21:59:03,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-11-24 21:59:03,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-11-24 21:59:03,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-11-24 21:59:03,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-11-24 21:59:03,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-11-24 21:59:03,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-11-24 21:59:03,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-11-24 21:59:03,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-11-24 21:59:03,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-11-24 21:59:03,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-11-24 21:59:03,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-11-24 21:59:03,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-11-24 21:59:03,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-11-24 21:59:03,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-11-24 21:59:03,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-11-24 21:59:03,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-11-24 21:59:03,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-11-24 21:59:03,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-11-24 21:59:03,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-11-24 21:59:03,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-11-24 21:59:03,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-11-24 21:59:03,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2023-11-24 21:59:03,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2023-11-24 21:59:03,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2023-11-24 21:59:03,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2023-11-24 21:59:03,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-11-24 21:59:03,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-11-24 21:59:03,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-11-24 21:59:03,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-11-24 21:59:03,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2023-11-24 21:59:03,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2023-11-24 21:59:03,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2023-11-24 21:59:03,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-11-24 21:59:03,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-11-24 21:59:03,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2023-11-24 21:59:03,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2023-11-24 21:59:03,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2023-11-24 21:59:03,255 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-11-24 21:59:03,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-11-24 21:59:03,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2023-11-24 21:59:03,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2023-11-24 21:59:03,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2023-11-24 21:59:03,256 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2023-11-24 21:59:03,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 21:59:03,257 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:03,263 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-24 21:59:03,264 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-24 21:59:03,377 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre14 could not be translated [2023-11-24 21:59:03,394 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre16 could not be translated [2023-11-24 21:59:03,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre18 could not be translated [2023-11-24 21:59:03,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 09:59:03 BasicIcfg [2023-11-24 21:59:03,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-24 21:59:03,453 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-24 21:59:03,453 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-24 21:59:03,453 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-24 21:59:03,454 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:43" (3/4) ... [2023-11-24 21:59:03,457 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-24 21:59:03,458 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-24 21:59:03,459 INFO L158 Benchmark]: Toolchain (without parser) took 22973.64ms. Allocated memory was 132.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 84.3MB in the beginning and 899.5MB in the end (delta: -815.3MB). Peak memory consumption was 243.2MB. Max. memory is 16.1GB. [2023-11-24 21:59:03,461 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 132.1MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:59:03,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.85ms. Allocated memory is still 132.1MB. Free memory was 83.8MB in the beginning and 60.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-24 21:59:03,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.41ms. Allocated memory is still 132.1MB. Free memory was 60.9MB in the beginning and 58.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 21:59:03,462 INFO L158 Benchmark]: Boogie Preprocessor took 99.91ms. Allocated memory is still 132.1MB. Free memory was 58.5MB in the beginning and 54.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-24 21:59:03,463 INFO L158 Benchmark]: RCFGBuilder took 1990.45ms. Allocated memory was 132.1MB in the beginning and 195.0MB in the end (delta: 62.9MB). Free memory was 54.7MB in the beginning and 138.1MB in the end (delta: -83.4MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2023-11-24 21:59:03,463 INFO L158 Benchmark]: TraceAbstraction took 20091.93ms. Allocated memory was 195.0MB in the beginning and 1.2GB in the end (delta: 994.1MB). Free memory was 137.0MB in the beginning and 899.5MB in the end (delta: -762.5MB). Peak memory consumption was 232.6MB. Max. memory is 16.1GB. [2023-11-24 21:59:03,463 INFO L158 Benchmark]: Witness Printer took 5.45ms. Allocated memory is still 1.2GB. Free memory is still 899.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 21:59:03,465 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.35ms. Allocated memory is still 132.1MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.85ms. Allocated memory is still 132.1MB. Free memory was 83.8MB in the beginning and 60.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.41ms. Allocated memory is still 132.1MB. Free memory was 60.9MB in the beginning and 58.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.91ms. Allocated memory is still 132.1MB. Free memory was 58.5MB in the beginning and 54.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1990.45ms. Allocated memory was 132.1MB in the beginning and 195.0MB in the end (delta: 62.9MB). Free memory was 54.7MB in the beginning and 138.1MB in the end (delta: -83.4MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20091.93ms. Allocated memory was 195.0MB in the beginning and 1.2GB in the end (delta: 994.1MB). Free memory was 137.0MB in the beginning and 899.5MB in the end (delta: -762.5MB). Peak memory consumption was 232.6MB. Max. memory is 16.1GB. * Witness Printer took 5.45ms. Allocated memory is still 1.2GB. Free memory is still 899.5MB. 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 Unfinished Backtranslation: IdentifierExpression #t~pre18 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t2061; [L837] FCALL, FORK 0 pthread_create(&t2061, ((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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2061={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L838] 0 pthread_t t2062; [L839] FCALL, FORK 0 pthread_create(&t2062, ((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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2061={7:0}, t2062={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 \read(z) [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L781] 1 __unbuffered_p0_EBX = 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L786] 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] 0 pthread_t t2063; [L841] FCALL, FORK 0 pthread_create(&t2063, ((void *)0), P2, ((void *)0)) 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2061={7:0}, t2062={5:0}, t2063={6:0}, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L793] 2 x = 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L796] 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L808] 3 __unbuffered_p2_EAX = y 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L811] 3 z = 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L801] 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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2061={7:0}, t2062={5:0}, t2063={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2061={7:0}, t2062={5:0}, t2063={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2061={7:0}, t2062={5:0}, t2063={6:0}, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L858] 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=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L18] 0 __assert_fail ("0", "safe012_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __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_buff0_thd3=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$r_buff1_thd3=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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={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: -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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: 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 7 procedures, 117 locations, 53 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: 19.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 973 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 796 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2091 IncrementalHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 30 mSDtfsCounter, 2091 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=15, InterpolantAutomatonStates: 72, 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.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 212 ConstructedInterpolants, 0 QuantifiedInterpolants, 1517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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:59:03,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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_55e37e17-ba82-492b-8a92-018a6ff98072/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 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:59:06,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:59:06,409 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-24 21:59:06,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:59:06,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:59:06,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:59:06,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:59:06,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:59:06,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:59:06,480 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:59:06,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:59:06,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:59:06,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:59:06,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:59:06,483 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:59:06,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:59:06,484 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:59:06,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:59:06,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:59:06,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:59:06,487 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:59:06,487 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:59:06,488 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:59:06,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:59:06,488 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:59:06,489 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 21:59:06,489 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 21:59:06,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:59:06,490 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:59:06,490 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:59:06,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:59:06,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:59:06,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:59:06,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:59:06,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:59:06,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:59:06,495 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:59:06,495 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 21:59:06,495 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 21:59:06,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:59:06,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:59:06,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:59:06,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:59:06,497 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-24 21:59:06,497 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_55e37e17-ba82-492b-8a92-018a6ff98072/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_55e37e17-ba82-492b-8a92-018a6ff98072/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 -> 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e [2023-11-24 21:59:06,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:59:06,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:59:06,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:59:06,930 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:59:06,930 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:59:06,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2023-11-24 21:59:10,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:59:10,549 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:59:10,550 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2023-11-24 21:59:10,584 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/data/62441dff6/ba2ba529e0d8406698a902acfbab3a1e/FLAG6288a0129 [2023-11-24 21:59:10,597 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/data/62441dff6/ba2ba529e0d8406698a902acfbab3a1e [2023-11-24 21:59:10,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:59:10,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:59:10,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:59:10,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:59:10,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:59:10,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:59:10" (1/1) ... [2023-11-24 21:59:10,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ec660e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:10, skipping insertion in model container [2023-11-24 21:59:10,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:59:10" (1/1) ... [2023-11-24 21:59:10,663 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:59:11,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:59:11,128 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:59:11,223 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:59:11,279 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:59:11,279 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:59:11,287 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:59:11,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11 WrapperNode [2023-11-24 21:59:11,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:59:11,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:59:11,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:59:11,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:59:11,297 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:59:11" (1/1) ... [2023-11-24 21:59:11,334 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:59:11" (1/1) ... [2023-11-24 21:59:11,372 INFO L138 Inliner]: procedures = 180, calls = 68, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2023-11-24 21:59:11,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:59:11,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:59:11,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:59:11,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:59:11,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11" (1/1) ... [2023-11-24 21:59:11,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11" (1/1) ... [2023-11-24 21:59:11,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11" (1/1) ... [2023-11-24 21:59:11,411 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 1, 1, 1, 13]. 72 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 0, 1]. The 8 writes are split as follows [0, 1, 1, 1, 5]. [2023-11-24 21:59:11,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11" (1/1) ... [2023-11-24 21:59:11,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11" (1/1) ... [2023-11-24 21:59:11,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11" (1/1) ... [2023-11-24 21:59:11,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11" (1/1) ... [2023-11-24 21:59:11,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11" (1/1) ... [2023-11-24 21:59:11,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11" (1/1) ... [2023-11-24 21:59:11,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:59:11,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:59:11,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:59:11,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:59:11,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11" (1/1) ... [2023-11-24 21:59:11,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:59:11,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:59:11,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:11,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:11,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-24 21:59:11,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-24 21:59:11,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-24 21:59:11,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-24 21:59:11,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-24 21:59:11,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:59:11,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:59:11,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:59:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:59:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-24 21:59:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-24 21:59:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-24 21:59:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-24 21:59:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-24 21:59:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-24 21:59:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-24 21:59:11,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-24 21:59:11,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-24 21:59:11,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-24 21:59:11,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-24 21:59:11,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-24 21:59:11,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-24 21:59:11,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-24 21:59:11,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-11-24 21:59:11,556 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:59:11,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:59:11,557 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:59:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:59:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:59:11,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:59:11,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:59:11,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:59:11,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:59:11,561 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:59:11,800 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:59:11,802 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:59:12,438 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:59:13,060 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:59:13,061 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:59:13,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:59:13 BoogieIcfgContainer [2023-11-24 21:59:13,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:59:13,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:59:13,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:59:13,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:59:13,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:59:10" (1/3) ... [2023-11-24 21:59:13,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6d890b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:59:13, skipping insertion in model container [2023-11-24 21:59:13,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:11" (2/3) ... [2023-11-24 21:59:13,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6d890b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:59:13, skipping insertion in model container [2023-11-24 21:59:13,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:59:13" (3/3) ... [2023-11-24 21:59:13,073 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_rmo.oepc.i [2023-11-24 21:59:13,094 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:59:13,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-24 21:59:13,095 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:59:13,210 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:59:13,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 76 transitions, 164 flow [2023-11-24 21:59:13,296 INFO L124 PetriNetUnfolderBase]: 2/73 cut-off events. [2023-11-24 21:59:13,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:59:13,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 221 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2023-11-24 21:59:13,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 76 transitions, 164 flow [2023-11-24 21:59:13,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 73 transitions, 155 flow [2023-11-24 21:59:13,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:59:13,325 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;@701429e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:59:13,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-24 21:59:13,329 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:59:13,329 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:59:13,329 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:59:13,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:13,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:59:13,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:59:13,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash 19721, now seen corresponding path program 1 times [2023-11-24 21:59:13,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:13,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694010353] [2023-11-24 21:59:13,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:13,358 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:59:13,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:13,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:13,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:13,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:59:13,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:13,629 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:59:13,640 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:59:13,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:13,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694010353] [2023-11-24 21:59:13,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694010353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:13,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:13,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:13,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915189138] [2023-11-24 21:59:13,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:13,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:13,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:13,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:13,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:13,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 76 [2023-11-24 21:59:13,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:59:13,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:13,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 76 [2023-11-24 21:59:13,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:15,430 INFO L124 PetriNetUnfolderBase]: 3235/5332 cut-off events. [2023-11-24 21:59:15,431 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-24 21:59:15,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10136 conditions, 5332 events. 3235/5332 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 42789 event pairs, 2795 based on Foata normal form. 200/3312 useless extension candidates. Maximal degree in co-relation 10122. Up to 4127 conditions per place. [2023-11-24 21:59:15,512 INFO L140 encePairwiseOnDemand]: 61/76 looper letters, 47 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-11-24 21:59:15,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 73 transitions, 253 flow [2023-11-24 21:59:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2023-11-24 21:59:15,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6710526315789473 [2023-11-24 21:59:15,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 153 transitions. [2023-11-24 21:59:15,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 153 transitions. [2023-11-24 21:59:15,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:15,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 153 transitions. [2023-11-24 21:59:15,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states 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:59:15,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:15,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:15,543 INFO L175 Difference]: Start difference. First operand has 81 places, 73 transitions, 155 flow. Second operand 3 states and 153 transitions. [2023-11-24 21:59:15,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 73 transitions, 253 flow [2023-11-24 21:59:15,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 250 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-24 21:59:15,552 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 128 flow [2023-11-24 21:59:15,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2023-11-24 21:59:15,559 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -13 predicate places. [2023-11-24 21:59:15,559 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 128 flow [2023-11-24 21:59:15,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:59:15,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:15,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:59:15,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:15,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:15,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:59:15,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash 19722, now seen corresponding path program 1 times [2023-11-24 21:59:15,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:15,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855068511] [2023-11-24 21:59:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:15,767 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:59:15,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:15,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:15,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:15,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:59:15,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:15,968 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:59:15,980 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:59:15,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:15,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:15,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855068511] [2023-11-24 21:59:15,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855068511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:15,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:15,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:15,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648772682] [2023-11-24 21:59:15,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:15,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:15,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:15,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:16,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 76 [2023-11-24 21:59:16,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:59:16,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:16,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 76 [2023-11-24 21:59:16,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:17,230 INFO L124 PetriNetUnfolderBase]: 3235/5331 cut-off events. [2023-11-24 21:59:17,230 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-11-24 21:59:17,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10233 conditions, 5331 events. 3235/5331 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 42743 event pairs, 2795 based on Foata normal form. 1/3112 useless extension candidates. Maximal degree in co-relation 10222. Up to 4126 conditions per place. [2023-11-24 21:59:17,298 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 46 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-11-24 21:59:17,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 250 flow [2023-11-24 21:59:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2023-11-24 21:59:17,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-11-24 21:59:17,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 133 transitions. [2023-11-24 21:59:17,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 133 transitions. [2023-11-24 21:59:17,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:17,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 133 transitions. [2023-11-24 21:59:17,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:59:17,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:17,314 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:17,314 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 128 flow. Second operand 3 states and 133 transitions. [2023-11-24 21:59:17,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 250 flow [2023-11-24 21:59:17,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:17,326 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 126 flow [2023-11-24 21:59:17,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-11-24 21:59:17,328 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -14 predicate places. [2023-11-24 21:59:17,328 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 126 flow [2023-11-24 21:59:17,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states 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:59:17,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:17,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:17,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:17,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:17,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:59:17,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash 588145882, now seen corresponding path program 1 times [2023-11-24 21:59:17,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:17,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434281031] [2023-11-24 21:59:17,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:17,539 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:59:17,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:17,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:17,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:17,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 21:59:17,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:17,725 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:59:17,733 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:59:17,734 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:17,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:17,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434281031] [2023-11-24 21:59:17,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434281031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:17,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:17,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620100034] [2023-11-24 21:59:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:17,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:17,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 76 [2023-11-24 21:59:17,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:59:17,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:17,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 76 [2023-11-24 21:59:17,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:18,960 INFO L124 PetriNetUnfolderBase]: 3239/5312 cut-off events. [2023-11-24 21:59:18,960 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-11-24 21:59:18,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10223 conditions, 5312 events. 3239/5312 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 42354 event pairs, 2815 based on Foata normal form. 0/3101 useless extension candidates. Maximal degree in co-relation 10212. Up to 4129 conditions per place. [2023-11-24 21:59:19,014 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 47 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-11-24 21:59:19,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 250 flow [2023-11-24 21:59:19,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2023-11-24 21:59:19,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5745614035087719 [2023-11-24 21:59:19,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 131 transitions. [2023-11-24 21:59:19,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 131 transitions. [2023-11-24 21:59:19,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:19,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 131 transitions. [2023-11-24 21:59:19,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 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:59:19,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:19,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:19,020 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 126 flow. Second operand 3 states and 131 transitions. [2023-11-24 21:59:19,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 250 flow [2023-11-24 21:59:19,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:19,029 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 124 flow [2023-11-24 21:59:19,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-11-24 21:59:19,031 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -15 predicate places. [2023-11-24 21:59:19,031 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 124 flow [2023-11-24 21:59:19,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:59:19,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:19,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:19,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:19,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:19,237 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:59:19,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:19,238 INFO L85 PathProgramCache]: Analyzing trace with hash 588145883, now seen corresponding path program 1 times [2023-11-24 21:59:19,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:19,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543335088] [2023-11-24 21:59:19,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:19,239 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:59:19,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:19,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:19,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:19,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-24 21:59:19,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:19,395 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:59:19,409 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:59:19,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:19,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:19,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543335088] [2023-11-24 21:59:19,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543335088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:19,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:19,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:19,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445711836] [2023-11-24 21:59:19,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:19,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:19,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:19,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 76 [2023-11-24 21:59:19,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:59:19,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:19,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 76 [2023-11-24 21:59:19,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:20,444 INFO L124 PetriNetUnfolderBase]: 3235/5286 cut-off events. [2023-11-24 21:59:20,444 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2023-11-24 21:59:20,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10192 conditions, 5286 events. 3235/5286 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 43420 event pairs, 2811 based on Foata normal form. 5/3085 useless extension candidates. Maximal degree in co-relation 10182. Up to 4120 conditions per place. [2023-11-24 21:59:20,500 INFO L140 encePairwiseOnDemand]: 73/76 looper letters, 46 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-24 21:59:20,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 70 transitions, 246 flow [2023-11-24 21:59:20,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2023-11-24 21:59:20,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-11-24 21:59:20,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 133 transitions. [2023-11-24 21:59:20,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 133 transitions. [2023-11-24 21:59:20,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:20,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 133 transitions. [2023-11-24 21:59:20,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states 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:59:20,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:20,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:20,505 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 124 flow. Second operand 3 states and 133 transitions. [2023-11-24 21:59:20,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 70 transitions, 246 flow [2023-11-24 21:59:20,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 70 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:20,513 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 122 flow [2023-11-24 21:59:20,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2023-11-24 21:59:20,514 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -16 predicate places. [2023-11-24 21:59:20,514 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 122 flow [2023-11-24 21:59:20,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:59:20,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:20,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:20,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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)] Ended with exit code 0 [2023-11-24 21:59:20,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:20,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:59:20,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash 588147484, now seen corresponding path program 1 times [2023-11-24 21:59:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:20,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273952326] [2023-11-24 21:59:20,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:20,720 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:59:20,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:20,721 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:20,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:20,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 21:59:20,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 21:59:20,899 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-24 21:59:20,900 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:59:20,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:59:20,956 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 21:59:20,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 21:59:20,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273952326] [2023-11-24 21:59:20,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273952326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:20,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:20,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:20,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963962527] [2023-11-24 21:59:20,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:20,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:20,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 21:59:20,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:20,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:20,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 76 [2023-11-24 21:59:20,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:59:20,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:20,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 76 [2023-11-24 21:59:20,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:21,738 INFO L124 PetriNetUnfolderBase]: 1665/2847 cut-off events. [2023-11-24 21:59:21,739 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-11-24 21:59:21,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5442 conditions, 2847 events. 1665/2847 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 21535 event pairs, 1325 based on Foata normal form. 0/1937 useless extension candidates. Maximal degree in co-relation 5432. Up to 1910 conditions per place. [2023-11-24 21:59:21,769 INFO L140 encePairwiseOnDemand]: 68/76 looper letters, 40 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-24 21:59:21,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 222 flow [2023-11-24 21:59:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2023-11-24 21:59:21,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2023-11-24 21:59:21,771 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 135 transitions. [2023-11-24 21:59:21,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 135 transitions. [2023-11-24 21:59:21,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:21,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 135 transitions. [2023-11-24 21:59:21,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.0) internal successors, (135), 3 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:59:21,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:21,774 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:59:21,775 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 122 flow. Second operand 3 states and 135 transitions. [2023-11-24 21:59:21,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 222 flow [2023-11-24 21:59:21,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:21,778 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 128 flow [2023-11-24 21:59:21,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=76, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-11-24 21:59:21,779 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -17 predicate places. [2023-11-24 21:59:21,780 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 128 flow [2023-11-24 21:59:21,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:59:21,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:21,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:21,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:21,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:21,983 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-24 21:59:21,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:21,985 INFO L85 PathProgramCache]: Analyzing trace with hash 588147485, now seen corresponding path program 1 times [2023-11-24 21:59:21,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 21:59:21,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902251071] [2023-11-24 21:59:21,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:21,986 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:59:21,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/bin/uautomizer-verify-NlZe1sFDwI/mathsat [2023-11-24 21:59:21,990 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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:59:22,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55e37e17-ba82-492b-8a92-018a6ff98072/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